Solution to a problem on degree sequences of graphs

DOI10.1016/S0012-365X(00)00022-4zbMath0951.05026OpenAlexW2005706719MaRDI QIDQ1567678

Wenan Zang, Xiaotie Deng, Mao-cheng Cai

Publication date: 13 December 2000

Published in: Discrete Mathematics (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/s0012-365x(00)00022-4

zbMATH Keywords

characterizationdegree sequencesErdős-Gallai theorem

Mathematics Subject Classification ID

Edge subsets with special properties (factorization, matching, partitioning, covering and packing, etc.) (05C70) Vertex degrees (05C07)

Related Items (7)

Solution to a forcible version of a graphic sequence problem ⋮ A characterization of box-bounded degree sequences of graphs ⋮ Constructive extensions of two results on graphic sequences ⋮ An extension of A.R. Rao's characterization of potentially \(K_{m+1}\)-graphic sequences ⋮ A Characterization of the degree sequences of 2-trees ⋮ Efficiently Realizing Interval Sequences ⋮ Relaxed and approximate graph realizations

This page was built for publication: Solution to a problem on degree sequences of graphs