Steiner 4-diameter, maximum degree and size of a graph

Cites work

scientific article; zbMATH DE number 4137792 (Why is no real title available?)
scientific article; zbMATH DE number 3652373 (Why is no real title available?)
scientific article; zbMATH DE number 3639144 (Why is no real title available?)
scientific article; zbMATH DE number 194437 (Why is no real title available?)
scientific article; zbMATH DE number 3232670 (Why is no real title available?)
scientific article; zbMATH DE number 3273328 (Why is no real title available?)
scientific article; zbMATH DE number 3334009 (Why is no real title available?)
scientific article; zbMATH DE number 3353329 (Why is no real title available?)
scientific article; zbMATH DE number 3384060 (Why is no real title available?)
scientific article; zbMATH DE number 3395913 (Why is no real title available?)
A Characterization of Graphs of Diameter Two
A Lower Bound for the Number of Vertices of a Graph
Diameters in graphs
Distance in graphs
Distance-Hereditary Graphs, Steiner Trees, and Connected Domination
Graph theory
Line digraph iterations and connectivity analysis of de Bruijn and Kautz graphs
On the \(k\)-diameter of \(k\)-regular \(k\)-connected graphs
On the average Steiner distance of graphs with presribed properties
Rainbow trees in graphs and generalized connectivity
Steiner Distance-Hereditary Graphs
Steiner distance and convexity in graphs
Steiner distance in graphs
Steiner distance stable graphs
Steiner's problem in graphs and its implications
The Steiner diameter of a graph
The Steiner diameter of a graph with prescribed girth
The Steiner tree problem
Upper bounds on the Steiner diameter of a graph

This page was built for publication: Steiner 4-diameter, maximum degree and size of a graph

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5087601)