A simple proof of the Erdos-Gallai theorem on graph sequences
From MaRDI portal
Publication:3688436
DOI10.1017/S0004972700002872zbMath0571.05048OpenAlexW1969177806WikidataQ60326855 ScholiaQ60326855MaRDI QIDQ3688436
Publication date: 1986
Published in: Bulletin of the Australian Mathematical Society (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1017/s0004972700002872
Related Items
Vertex-weighted graphs: realizable and unrealizable domains ⋮ On vertex-weighted realizations of acyclic and general graphs ⋮ Graph realizations: maximum degree in vertex neighborhoods ⋮ Unnamed Item ⋮ On vertex-weighted graph realizations ⋮ A short constructive proof of the Erdős-Gallai characterization of graphic lists ⋮ How likely is an LLD degree sequence to be graphical? ⋮ Vertex-weighted realizations of graphs ⋮ A note on degree-continuous graphs ⋮ A simple criterion on degree sequences of graphs ⋮ Parameterized inapproximability of independent set in \(H\)-free graphs ⋮ A short constructive proof of A.R. Rao's characterization of potentially \(K_{r+1}\)-graphic sequences ⋮ Relaxed and approximate graph realizations