The principal Erdős-Gallai differences of a degree sequence
From MaRDI portal
Publication:2075508
DOI10.1016/j.disc.2021.112755zbMath1482.05044arXiv2107.07643OpenAlexW4200395858MaRDI QIDQ2075508
Publication date: 14 February 2022
Published in: Discrete Mathematics (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/2107.07643
Extremal problems in graph theory (05C35) Special sequences and polynomials (11B83) Vertex degrees (05C07)
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Hereditary unigraphs and Erdős-Gallai equalities
- Rao's degree sequence conjecture
- On fractional realizations of graph degree sequences
- Length thresholds for graphic lists given fixed largest and smallest entries and bounded gaps
- Degree sequences of matrogenic graphs
- Once more on matrogenic graphs
- Fuchsian equations of type DN
- The splittance of a graph
- Contributions to the theory of graphic sequences
- Sequences with a unique realization by simple graphs
- Graphic sequences with unique realization
- Degree sequences and majorization
- Linear recognition of pseudo-split graphs
- Decomposition of graphical sequences and unigraphs
- Adjacency relationships forced by a degree sequence
- Split graphs
- A note on a theorem of Erdős and Gallai
- Threshold graphs and related topics
- Laplacian spectra and spanning trees of threshold graphs
- Threshold Sequences
- A Note on Unigraphic Sequences
- Weakly threshold graphs
This page was built for publication: The principal Erdős-Gallai differences of a degree sequence
