Primitive diameter 2-critical graphs
From MaRDI portal
Recommendations
Cites work
- A characterization for 2-self-centered graphs
- A characterization of \(P_5\)-free, diameter-2-critical graphs
- A characterization of diameter-2-critical graphs with no antihole of length four
- A characterization of the non-trivial diameter two graphs of minimum size
- A maximum degree theorem for diameter-2-critical graphs
- Characterization of graphs of diameter 2 containing a homeomorphically irreducible spanning tree
- Diameters in graphs
- scientific article; zbMATH DE number 568786 (Why is no real title available?)
- scientific article; zbMATH DE number 740754 (Why is no real title available?)
- On diameter 2-critical graphs
- On diameter critical graphs
- On graphs with diameter 2
- Regular graphs. A spectral approach
- Some notes on minimal self-centered graphs
- Strengthening the Murty-Simon conjecture on diameter 2 critical graphs
- The maximum number of edges in a minimal graph of diameter 2
- Total domination edge critical graphs with total domination number three and many dominating pairs
This page was built for publication: Primitive diameter 2-critical graphs
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6585150)