A short constructive proof of the Erdős-Gallai characterization of graphic lists
From MaRDI portal
Publication:965964
DOI10.1016/j.disc.2009.09.023zbMath1209.05058OpenAlexW1986717972WikidataQ60326858 ScholiaQ60326858MaRDI QIDQ965964
Amitabha Tripathi, Sushmita Venugopalan, Douglas B. West
Publication date: 27 April 2010
Published in: Discrete Mathematics (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.disc.2009.09.023
Related Items (18)
Vertex-weighted graphs: realizable and unrealizable domains ⋮ Independence number of graphs and line graphs of trees by means of omega invariant ⋮ On vertex-weighted realizations of acyclic and general graphs ⋮ A Gale-Ryser type characterization of potentially \(K_{s,t}\)-bigraphic pairs ⋮ Constructive extensions of two results on graphic sequences ⋮ Methods for the graph realization problem ⋮ On vertex-weighted graph realizations ⋮ Exact and approximate results on the least size of a graph with a given degree set ⋮ Efficiently Realizing Interval Sequences ⋮ Extremal problems on components and loops in graphs ⋮ A constructive extension of the characterization on potentially \(K_{s,t}\)-bigraphic pairs ⋮ Recognition of split-graphic sequences ⋮ Vertex-weighted realizations of graphs ⋮ Bigraphic pairs with a realization containing a split bipartite-graph ⋮ Precise asymptotics of some meeting times arising from the voter model on large random regular graphs ⋮ A short constructive proof of A.R. Rao's characterization of potentially \(K_{r+1}\)-graphic sequences ⋮ A sharp refinement of a result of Zverovich-Zverovich ⋮ Relaxed and approximate graph realizations
Cites Work
- Unnamed Item
- Unnamed Item
- A simple criterion on degree sequences of graphs
- Parallel concepts in graph theory
- Realizability and uniqueness in graphs
- Threshold graphs and related topics
- Extreme degree sequences of simple graphs
- A remark on the existence of finite graphs
- A simple proof of the Erdos-Gallai theorem on graph sequences
- On Realizability of a Set of Integers as Degrees of the Vertices of a Linear Graph. I
- Seven criteria for integer sequences being graphic
This page was built for publication: A short constructive proof of the Erdős-Gallai characterization of graphic lists
