A characterization of diameter-2-critical graphs whose complements are diamond-free

DOI10.1016/j.dam.2012.03.037zbMath1246.05047OpenAlexW1969830205MaRDI QIDQ442211

Teresa W. Haynes, Michael A. Henning

Publication date: 10 August 2012

Published in: Discrete Applied Mathematics (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.dam.2012.03.037

zbMATH Keywords

diameter criticaldiameter-2-criticaltotal domination critical

Mathematics Subject Classification ID

Distance in graphs (05C12) Vertex subsets with special properties (dominating sets, independent sets, cliques, etc.) (05C69)

Related Items (4)

Blocking the \(k\)-holes of point sets in the plane ⋮ 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
• 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
• A survey of selected recent results on total domination in graphs
• On diameter 2-critical graphs
• On diameter critical 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 characterization of diameter-2-critical graphs whose complements are diamond-free