Maximal and minimal vertex-critical graphs of diameter two

DOI10.1006/jctb.1998.1852zbMath0904.05054OpenAlexW2144012227MaRDI QIDQ1127872

Anders Yeo, Jing Huang

Publication date: 10 September 1998

Published in: Journal of Combinatorial Theory. Series B (Search for Journal in Brave)

Full work available at URL: https://semanticscholar.org/paper/3ea163c299198a1823acf781324e4008b99ee204

zbMATH Keywords

diametercritical graphnumber of edges

Mathematics Subject Classification ID

Extremal problems in graph theory (05C35)

Related Items (2)

Diameter critical graphs ⋮ Matching cutsets in graphs of diameter 2

Cites Work

• The minimum number of edges in a vertex diameter-2-critical graph
• The complexity of designing a network with minimum diameter
• Vertex-critical graphs of given diameter
• On vertex critical graphs with prescribed diameter
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item

This page was built for publication: Maximal and minimal vertex-critical graphs of diameter two