A characterization of diameter-2-critical graphs with no antihole of length four

DOI10.2478/S11533-012-0022-XzbMath1239.05055OpenAlexW2059066636MaRDI QIDQ424139

Michael A. Henning, Teresa W. Haynes

Publication date: 31 May 2012

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

Full work available at URL: https://doi.org/10.2478/s11533-012-0022-x

zbMATH Keywords

diameter criticaldiameter-2-criticaltotal domination criticalantihole

Mathematics Subject Classification ID

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

Related Items (5)

A maximum degree theorem for diameter-2-critical graphs ⋮ A characterization of \(P_5\)-free, diameter-2-critical graphs ⋮ 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 ⋮ All My Favorite Conjectures Are Critical

Cites Work

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

This page was built for publication: A characterization of diameter-2-critical graphs with no antihole of length four