Solution to a problem on degree sequences of graphs
From MaRDI portal
Recommendations
Cited in
(15)- scientific article; zbMATH DE number 6667019 (Why is no real title available?)
- scientific article; zbMATH DE number 1823784 (Why is no real title available?)
- A variant of Niessen's problem on degree sequences of graphs
- Constructive extensions of two results on graphic sequences
- Some NP-complete problems for hypergraph degree sequences
- An extremal problem on degree sequences of graphs
- Relaxed and approximate graph realizations
- A simple proof of the Erdos-Gallai theorem on graph sequences
- Not all simple looking degree sequence problems are easy
- Solution to a forcible version of a graphic sequence problem
- A characterization of box-bounded degree sequences of graphs
- Finding structure in sequences of real numbers via graph theory: a problem list
- An extension of A.R. Rao's characterization of potentially \(K_{m+1}\)-graphic sequences
- Efficiently realizing interval sequences
- scientific article; zbMATH DE number 1618191 (Why is no real title available?)
This page was built for publication: Solution to a problem on degree sequences of graphs
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1567678)