The following pages link to On Critical Graphs of Diameter 2 (Q5554160):
Displayed 20 items.
- A maximum degree theorem for diameter-2-critical graphs (Q403217) (← links)
- A characterization of diameter-2-critical graphs with no antihole of length four (Q424139) (← links)
- A characterization of diameter-2-critical graphs whose complements are diamond-free (Q442211) (← links)
- Total domination edge critical graphs with total domination number three and many dominating pairs (Q497305) (← links)
- Progress on the Murty-Simon conjecture on diameter-2 critical graphs: a survey (Q498431) (← links)
- Perfect matchings in total domination critical graphs (Q659733) (← links)
- A proof of a conjecture on diameter 2-critical graphs whose complements are claw-free (Q666001) (← links)
- Diameter critical graphs (Q905895) (← links)
- Regular separable graphs of minimum order with given diameter (Q1148920) (← links)
- The ubiquitous Petersen graph (Q1198655) (← links)
- Graphs with small diameter after edge deletion (Q1199416) (← links)
- Optimal design and augmentation of strongly attack-tolerant two-hop clusters in directed networks (Q2015788) (← links)
- On the number of edges in a graph with many two-hop disjoint paths (Q2192123) (← links)
- On a conjecture of Murty and Simon on diameter 2-critical graphs (Q2275449) (← links)
- A characterization of \(P_5\)-free, diameter-2-critical graphs (Q2449064) (← links)
- Exponent-critical primitive graphs and the Kronecker product (Q5009957) (← links)
- Property <i>P</i><sub><i>d</i>,<i>m</i></sub> and efficient design of reliable networks (Q5326767) (← links)
- Robustness and Strong Attack Tolerance of Low-Diameter Networks (Q5326889) (← links)
- All My Favorite Conjectures Are Critical (Q5506776) (← links)
- Graph theory (Q5917392) (← links)