Pages that link to "Item:Q409426"
From MaRDI portal
The following pages link to On the minimum number of edges of two-connected graphs with given diameter (Q409426):
Displaying 10 items.
- Note on minimally \(d\)-rainbow connected graphs (Q742605) (← links)
- Extremal 2-connected graphs with given diameter (Q1304925) (← links)
- Minimum edge cuts in diameter 2 graphs (Q1717218) (← links)
- On the number of edges in a graph with many two-hop disjoint paths (Q2192123) (← links)
- A characterization of the non-trivial diameter two graphs of minimum size (Q2348058) (← links)
- The smallest number of edges in a 2-connected graph with specified diameter (Q2384419) (← links)
- (Q3758864) (← links)
- Constrained length connectivity and survivable networks (Q4509380) (← links)
- (Q4898160) (← links)
- (Q5000321) (← links)