scientific article; zbMATH DE number 3882468
From MaRDI portal
Publication:3216684
Recommendations
Cited in
(17)- Extremal 2-connected graphs with given diameter
- Intersecting designs from linear programming and graphs of diameter two
- Size in maximal triangle-free graphs and minimal graphs of diameter 2
- Steiner diameter, maximum degree and size of a graph
- A characterization of the non-trivial diameter two graphs of minimum size
- The smallest number of edges in a 2-connected graph with specified diameter
- Graphs of diameter 3 with the minimum number of edges
- scientific article; zbMATH DE number 4158654 (Why is no real title available?)
- scientific article; zbMATH DE number 3924817 (Why is no real title available?)
- scientific article; zbMATH DE number 4008431 (Why is no real title available?)
- The maximum number of edges in a minimal graph of diameter 2
- scientific article; zbMATH DE number 165093 (Why is no real title available?)
- An Extremal Problem of Graphs with Diameter 2
- scientific article; zbMATH DE number 1225794 (Why is no real title available?)
- scientific article; zbMATH DE number 772775 (Why is no real title available?)
- scientific article; zbMATH DE number 3212735 (Why is no real title available?)
- scientific article; zbMATH DE number 3333196 (Why is no real title available?)
This page was built for publication:
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3216684)