A characterization of \(P_5\)-free, diameter-2-critical graphs

DOI10.1016/j.dam.2014.01.009zbMath1288.05069MaRDI QIDQ2449064

Teresa W. Haynes, Michael A. Henning

Publication date: 6 May 2014

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

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

zbMATH Keywords

diameter critical; diameter-2-critical; total domination critical; \(P_5\)-free

Mathematics Subject Classification ID

05C35: Extremal problems in graph theory

05C12: Distance in graphs

05C69: Vertex subsets with special properties (dominating sets, independent sets, cliques, etc.)

Related Items

All My Favorite Conjectures Are Critical, Total domination edge critical graphs with total domination number three and many dominating pairs, Progress on the Murty-Simon conjecture on diameter-2 critical graphs: a survey

Cites Work

• 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
• 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