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

Authors

111

  1. MC
    Martin Charles Golumbic

    University of Haifa, Israel

    2 publications · 30 citations

    2

    h-index

  2. JM
    Jens Myrup Pedersen

    Aalborg University, Denmark

    2 publications · 21 citations

    2

    h-index

  3. GJ
    Gerard J. Chang

    National Yang Ming Chiao Tung University, Taiwan

    2 publications · 126 citations

    2

    h-index

  4. AS
    A. Stoimenow

    Max Planck Institute for Mathematics, Germany

    1 publications · 21 citations

    1

    h-index

  5. SK
    Sandi Klavžar

    University of Maribor, Slovenia

    1 publications · 10 citations

    1

    h-index

1–5 of 111

Venues

  1. Discrete Mathematics

    9 publications · 574 citations

    9

    h-index

  2. Discrete Applied Mathematics

    7 publications · 362 citations

    7

    h-index

  3. Graphs and Combinatorics

    5 publications · 84 citations

    5

    h-index

  4. Journal of Graph Theory

    3 publications · 56 citations

    3

    h-index

  5. Information Processing Letters

    2 publications · 53 citations

    2

    h-index

1–5