Chordal Graph Diameter
Chordal Graph Diameter is a metric in graph theory that quantifies the longest shortest path between any two vertices in a chordal graph, distinguished by its restriction to graphs in which every cycle of four or more vertices has a chord.
49
Publications
2K
Citations
111
Authors
90
Institutions
Publications per year
2017–2026
2
Parents
49
Characterizations of strongly chordal graphs
Martin Farber · Discrete Mathematics · 1983 · 350 citations
Analysis of Chordal Ring Network
Hikyu Lee · IEEE Transactions on Computers · 1981 · 276 citations
On the Hyperbolicity of Chordal Graphs
Gunnar Brinkmann, Jack H. Koolen · Annals of Combinatorics · 2001 · 92 citations
1–5 of 49
111
2
h-index
2
h-index
2
h-index
1
h-index
1
h-index
1–5 of 111
90

Centre National de la Recherche Scientifique
Paris, France
3 h-index
3 publications
69 citations

University of Waterloo
Waterloo, Canada
2 h-index
2 publications
361 citations
Simon Fraser University
Burnaby, Canada
2 h-index
3 publications
84 citations
University of Haifa
Haifa, Israel
2 h-index
2 publications
30 citations

Universidade Federal do Rio de Janeiro
Rio de Janeiro, Brazil
2 h-index
3 publications
46 citations
Aalborg University
Aalborg, Denmark
2 h-index
4 publications
43 citations

Hungarian Academy of Sciences
Budapest, Hungary
2 h-index
2 publications
96 citations

Serbian Academy of Sciences and Arts
Belgrade, Serbia
1 h-index
1 publications
52 citations
1–8 of 90
9 publications · 574 citations
9
h-index
7 publications · 362 citations
7
h-index
5 publications · 84 citations
5
h-index
3 publications · 56 citations
3
h-index
2 publications · 53 citations
2
h-index
1–5