On the least size of a graph with a given degree set
From MaRDI portal
Publication:860412
Recommendations
Cites work
Cited in
(14)- Tripartite graphs with given degree set
- On degree sets in \(k\)-partite graphs
- On degree sets and the minimum orders in bipartite graphs
- A note on degree-continuous graphs
- scientific article; zbMATH DE number 2188428 (Why is no real title available?)
- On size, order, diameter and edge-connectivity of graphs
- A short proof of a theorem on degree sets of graphs
- On size, order, diameter and minimum degree
- scientific article; zbMATH DE number 2121222 (Why is no real title available?)
- Smallest Graphs Achieving the Stinson Bound
- On the order of a graph with a given degree set
- Exact and approximate results on the least size of a graph with a given degree set
- scientific article; zbMATH DE number 1475276 (Why is no real title available?)
- Some remarks on degree sets of multigraphs
This page was built for publication: On the least size of a graph with a given degree set
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q860412)