Diameter critical graphs

DOI10.1016/J.JCTB.2015.11.004zbMath1329.05097arXiv1406.6736OpenAlexW2150527183MaRDI QIDQ905895

Po-Shen Loh, Jie Ma

Publication date: 28 January 2016

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

Full work available at URL: https://arxiv.org/abs/1406.6736

zbMATH Keywords

diameterextremal graph theorycriticalMurty-Simon conjecture

Mathematics Subject Classification ID

Extremal problems in graph theory (05C35) Distance in graphs (05C12)

Related Items (5)

Embedding Graphs into Larger Graphs: Results, Methods, and Problems ⋮ SAT modulo symmetries for graph generation and enumeration ⋮ Complexity and algorithms for constant diameter augmentation problems ⋮ Strengthening the Murty-Simon conjecture on diameter 2 critical graphs ⋮ Exponent-critical primitive graphs and the Kronecker product

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Progress on the Murty-Simon conjecture on diameter-2 critical graphs: a survey
• On diameter 2-critical graphs
• Maximal and minimal vertex-critical graphs of diameter two
• On diameter critical graphs
• Graphs with small diameter after edge deletion
• On graphs with diameter 2
• Extremal graphs of diameter 4
• The maximum number of edges in a minimal graph of diameter 2
• An Extremal Problem of Graphs with Diameter 2
• A problem of the theory of communication networks
• On some extremal graphs
• On Critical Graphs of Diameter 2
• Diameters in graphs
• Minimum vertex‐diameter‐2‐critical graphs

This page was built for publication: Diameter critical graphs