Pages that link to "Item:Q5711697"
From MaRDI portal
The following pages link to Minimum vertex‐diameter‐2‐critical graphs (Q5711697):
Displaying 11 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)
- Diameter critical graphs (Q905895) (← links)
- Maximal and minimal vertex-critical graphs of diameter two (Q1127872) (← links)
- The minimum number of edges in a vertex diameter-2-critical graph (Q1356444) (← links)
- Minimum edge cuts in diameter 2 graphs (Q1717218) (← links)
- A characterization of \(P_5\)-free, diameter-2-critical graphs (Q2449064) (← links)
- (Q3758864) (← links)
- SAT modulo symmetries for graph generation and enumeration (Q6610196) (← links)