A Havel-Hakimi type procedure and a sufficient condition for a sequence to be potentially S r,s -graphic

DOI10.1007/s10587-012-0051-4zbMath1265.05130OpenAlexW2086271872MaRDI QIDQ4898764

Jian Hua Yin

Publication date: 2 January 2013

Published in: Czechoslovak Mathematical Journal (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/s10587-012-0051-4

zbMATH Keywords

split graphdegree sequence

Mathematics Subject Classification ID

Vertex degrees (05C07)

Related Items (2)

Recognition of split-graphic sequences ⋮ On multigraphic and potentially multigraphic sequences

Cites Work

• A Rao-type characterization for a sequence to have a realization containing a split graph
• Potentially K m — G-graphical sequences: A survey
• A remark on the existence of finite graphs
• On Realizability of a Set of Integers as Degrees of the Vertices of a Linear Graph. I

This page was built for publication: A Havel-Hakimi type procedure and a sufficient condition for a sequence to be potentially S r,s -graphic