The following pages link to Diameter critical graphs (Q905895):
Displaying 16 items.
- Diameter-vital edges in a graph (Q657835) (← links)
- There exist highly critically connected graphs of diameter three (Q882783) (← links)
- The minimum number of edges in a vertex diameter-2-critical graph (Q1356444) (← links)
- Diameter-essential edges in a graph (Q1861214) (← links)
- Complexity and algorithms for constant diameter augmentation problems (Q2072060) (← links)
- Strengthening the Murty-Simon conjecture on diameter 2 critical graphs (Q2324502) (← links)
- Concerning the number of edges in a graph with diameter constraints (Q2721331) (← links)
- Embedding Graphs into Larger Graphs: Results, Methods, and Problems (Q3295275) (← links)
- (Q4217583) (← links)
- (Q4261824) (← links)
- (Q4489239) (← links)
- (Q4780517) (← links)
- Exponent-critical primitive graphs and the Kronecker product (Q5009957) (← links)
- Distance-Uniform Graphs with Large Diameter (Q5232139) (← links)
- (Q5450589) (← links)
- SAT modulo symmetries for graph generation and enumeration (Q6610196) (← links)