A maximum degree theorem for diameter-2-critical graphs
DOI10.2478/S11533-014-0449-3zbMATH Open1297.05074OpenAlexW1995854326MaRDI QIDQ403217FDOQ403217
Authors: Teresa W. Haynes, Michael A. Henning, A. Yeo, Lucas 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
Recommendations
- On a conjecture of Murty and Simon on diameter 2-critical graphs
- Strengthening the Murty-Simon conjecture on diameter 2 critical graphs
- On diameter 2-critical graphs
- On a conjecture of Murty and Simon on diameter two critical graphs. II.
- Progress on the Murty-Simon conjecture on diameter-2 critical graphs: a survey
Extremal problems in graph theory (05C35) Vertex subsets with special properties (dominating sets, independent sets, cliques, etc.) (05C69) Distance in graphs (05C12) Hypergraphs (05C65)
Cites Work
- Title not available (Why is that?)
- Title not available (Why is that?)
- A survey of selected recent results on total domination in graphs
- Recognizing bull-free perfect graphs
- Title not available (Why is that?)
- Ramsey-type theorems
- Title not available (Why is that?)
- 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
- Title not available (Why is that?)
- A characterization of diameter-2-critical graphs with no antihole of length four
- Title not available (Why is that?)
- On Critical Graphs of Diameter 2
- Minimum vertex‐diameter‐2‐critical graphs
- 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
Cited In (14)
- All my favorite conjectures are critical
- The degree/diameter problem in maximal planar bipartite graphs
- The degree/diameter problem in maximal planar bipartite graphs
- Strengthening the Murty-Simon conjecture on diameter 2 critical graphs
- Title not available (Why is that?)
- Title not available (Why is that?)
- Title not available (Why is that?)
- On diameter 2-critical graphs
- Primitive diameter 2-critical graphs
- SAT modulo symmetries for graph generation and enumeration
- Counterexamples to a conjecture of Erdős, Pach, Pollack and Tuza
- Progress on the Murty-Simon conjecture on diameter-2 critical graphs: a survey
- The maximum number of edges in a minimal graph of diameter 2
- Diameter critical graphs
This page was built for publication: A maximum degree theorem for diameter-2-critical graphs
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q403217)