On diameter critical graphs
From MaRDI portal
Publication:1132894
DOI10.1016/0012-365X(79)90129-8zbMath0421.05042MaRDI QIDQ1132894
Louis Caccetta, Roland Haeggkvist
Publication date: 1979
Published in: Discrete Mathematics (Search for Journal in Brave)
Related Items
A maximum degree theorem for diameter-2-critical graphs, A characterization of diameter-2-critical graphs with no antihole of length four, A characterization of diameter-2-critical graphs whose complements are diamond-free, On the existence of \(k\)-partite or \(K_p\)-free total domination edge-critical graphs, On a conjecture of Murty and Simon on diameter two critical graphs. II., Perfect matchings in total domination critical graphs, A proof of a conjecture on diameter 2-critical graphs whose complements are claw-free, Properties of total domination edge-critical graphs, On diameter 2-critical graphs, The minimum number of edges in a vertex diameter-2-critical graph, Constructing goal-minimally \(k\)-diametric graphs by lifts, Size in maximal triangle-free graphs and minimal graphs of diameter 2, On a conjecture of Murty and Simon on diameter 2-critical graphs, A characterization of \(P_5\)-free, diameter-2-critical graphs
Cites Work
