The following pages link to (Q3758864):
Displaying 14 items.
- On the minimum number of edges of two-connected graphs with given diameter (Q409426) (← links)
- Separating systems and oriented graphs of diameter two (Q864898) (← links)
- Extremal 2-connected graphs with given diameter (Q1304925) (← links)
- Intersecting designs from linear programming and graphs of diameter two (Q1322228) (← links)
- Matchings and covers in hypergraphs (Q1813100) (← links)
- Steiner diameter, maximum degree and size of a graph (Q2032893) (← links)
- A characterization of the non-trivial diameter two graphs of minimum size (Q2348058) (← links)
- The maximum number of edges in a minimal graph of diameter 2 (Q3990877) (← links)
- (Q4033012) (← links)
- An Extremal Problem of Graphs with Diameter 2 (Q4123359) (← links)
- On maximal triangle‐free graphs (Q4309986) (← links)
- Minimal size of a graph with diameter 2 and given maximal degree. II (Q4838481) (← links)
- On a problem in the theory of graphs (Q5339970) (← links)
- Problems of graph theory concerning optimal design (Q5610922) (← links)