A maximum degree theorem for diameter-2-critical graphs

DOI10.2478/s11533-014-0449-3zbMath1297.05074OpenAlexW1995854326MaRDI QIDQ403217

Teresa W. Haynes, Michael A. Henning, Anders Yeo, Lucas C. Van Der Merwe

Publication date: 29 August 2014

Published in: Central European Journal of Mathematics (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.2478/s11533-014-0449-3

zbMATH Keywords

diameter criticaldiameter-2-criticaltotal domination critical

Mathematics Subject Classification ID

Extremal problems in graph theory (05C35) Hypergraphs (05C65) Distance in graphs (05C12) Vertex subsets with special properties (dominating sets, independent sets, cliques, etc.) (05C69)

Related Items (3)

Progress on the Murty-Simon conjecture on diameter-2 critical graphs: a survey ⋮ Strengthening the Murty-Simon conjecture on diameter 2 critical graphs ⋮ All My Favorite Conjectures Are Critical

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• A characterization of diameter-2-critical graphs with no antihole of length four
• On a conjecture of Murty and Simon on diameter two critical graphs. II.
• A proof of a conjecture on diameter 2-critical graphs whose complements are claw-free
• Ramsey-type theorems
• A survey of selected recent results on total domination in graphs
• On diameter 2-critical graphs
• On diameter critical graphs
• Recognizing bull-free perfect graphs
• On a conjecture of Murty and Simon on diameter 2-critical graphs
• The maximum number of edges in a minimal graph of diameter 2
• On Critical Graphs of Diameter 2
• Minimum vertex‐diameter‐2‐critical graphs

This page was built for publication: A maximum degree theorem for diameter-2-critical graphs