Solution to a problem on degree sequences of graphs
From MaRDI portal
Recommendations
Cited in
(16)- Some NP-complete problems for hypergraph degree sequences
- Not all simple looking degree sequence problems are easy
- An extremal problem on degree sequences of graphs
- An extension of A.R. Rao's characterization of potentially \(K_{m+1}\)-graphic sequences
- Relaxed and approximate graph realizations
- Solution to a forcible version of a graphic sequence problem
- Finding structure in sequences of real numbers via graph theory: a problem list
- A characterization of box-bounded degree sequences of graphs
- scientific article; zbMATH DE number 1618191 (Why is no real title available?)
- scientific article; zbMATH DE number 1823784 (Why is no real title available?)
- scientific article; zbMATH DE number 6667019 (Why is no real title available?)
- A simple proof of the Erdos-Gallai theorem on graph sequences
- Constructive extensions of two results on graphic sequences
- Efficiently realizing interval sequences
- A variant of Niessen's problem on degree sequences of graphs
- On the existence of tripartite graphs and n-partite graphs
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)