A proof of a conjecture on diameter 2-critical graphs whose complements are claw-free
From MaRDI portal
Publication:666001
DOI10.1016/j.disopt.2011.04.003zbMath1236.05147OpenAlexW1965121071WikidataQ123352451 ScholiaQ123352451MaRDI QIDQ666001
Teresa W. Haynes, Michael A. Henning, Anders Yeo
Publication date: 7 March 2012
Published in: Discrete Optimization (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.disopt.2011.04.003
Related Items (9)
A maximum degree theorem for diameter-2-critical graphs ⋮ A characterization of diameter-2-critical graphs with no antihole of length four ⋮ A characterization of diameter-2-critical graphs whose complements are diamond-free ⋮ A characterization of \(P_5\)-free, diameter-2-critical graphs ⋮ On a conjecture of Murty and Simon on diameter two critical graphs. II. ⋮ 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 ⋮ Strengthening the Murty-Simon conjecture on diameter 2 critical graphs ⋮ All My Favorite Conjectures Are Critical
Cites Work
- Claw-free graphs. III: Circular interval graphs
- Claw-free graphs. IV: Decomposition theorem
- Claw-free graphs. V. Global structure
- A survey of selected recent results on total domination in graphs
- On diameter 2-critical graphs
- On diameter critical graphs
- Claw-free graphs---a survey
- On a conjecture of Murty and Simon on diameter 2-critical graphs
- Claw-free graphs. I: Orientable prismatic graphs
- Claw-free graphs. II: Non-orientable prismatic graphs
- Total domination in graphs
- The maximum number of edges in a minimal graph of diameter 2
- On Critical Graphs of Diameter 2
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
This page was built for publication: A proof of a conjecture on diameter 2-critical graphs whose complements are claw-free
