The following pages link to On diameter 2-critical graphs (Q1096642):
Displaying 31 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)
- On the existence of \(k\)-partite or \(K_p\)-free total domination edge-critical graphs (Q539864) (← links)
- On a conjecture of Murty and Simon on diameter two critical graphs. II. (Q658055) (← 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)
- Extremal graphs domination insensitive to the removal of \(k\) edges (Q686272) (← links)
- Diameter critical graphs (Q905895) (← links)
- Properties of total domination edge-critical graphs (Q968121) (← links)
- The minimum number of edges in a vertex diameter-2-critical graph (Q1356444) (← links)
- Constructing goal-minimally \(k\)-diametric graphs by lifts (Q1759397) (← links)
- Size in maximal triangle-free graphs and minimal graphs of diameter 2 (Q1842148) (← links)
- Counterexamples to a conjecture of Erdős, Pach, Pollack and Tuza (Q1984510) (← links)
- On a conjecture of Murty and Simon on diameter 2-critical graphs (Q2275449) (← links)
- Strengthening the Murty-Simon conjecture on diameter 2 critical graphs (Q2324502) (← links)
- A characterization of \(P_5\)-free, diameter-2-critical graphs (Q2449064) (← links)
- Concerning the number of edges in a graph with diameter constraints (Q2721331) (← links)
- On a conjecture on the diameter of line graphs of graphs of diameter two (Q2867570) (← links)
- Embedding Graphs into Larger Graphs: Results, Methods, and Problems (Q3295275) (← links)
- (Q3842320) (← links)
- An extremal problem in graph theory (Q3966172) (← links)
- The maximum number of edges in a minimal graph of diameter 2 (Q3990877) (← links)
- (Q4217583) (← links)
- (Q4863434) (← links)
- All My Favorite Conjectures Are Critical (Q5506776) (← links)
- Minimum vertex‐diameter‐2‐critical graphs (Q5711697) (← links)
- Primitive diameter 2-critical graphs (Q6585150) (← links)
- SAT modulo symmetries for graph generation and enumeration (Q6610196) (← links)
