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

DOI10.1007/S10587-012-0051-4zbMATH Open1265.05130OpenAlexW2086271872MaRDI QIDQ4898764FDOQ4898764

Authors: 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

Recommendations

• A sufficient condition for \(r\)-graphic sequences to be potentially \(K^{(r)}_{l,m}\)
• On potentially \(H\)-graphic sequences
• On potentially H-graphic sequences
• On potentially \(A_{r,s}\)-graphic sequences
• Potentially \(H\)-graphic sequences
• A characterization for a graphic sequence to be potentially \(C_{r}\)-graphic
• A General Lower Bound for Potentially H-Graphic Sequences
• A characterization for a graphic sequence to be potentially \(K_{2,s}\)-graphic
• A note on the characterization of potentially \(K_{1,1,s}\)-graphic sequences.
• On a characterization for a graphic sequence to be potentially \(K_{r+1}-E(G)\)-graphic.

zbMATH Keywords

split graphdegree sequence

Mathematics Subject Classification ID

Vertex degrees (05C07)

Cites Work

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

Cited In (8)

• A Rao-type characterization for a sequence to have a realization containing a split graph
• A General Lower Bound for Potentially H-Graphic Sequences
• A sufficient condition for \(r\)-graphic sequences to be potentially \(K^{(r)}_{l,m}\)
• On multigraphic and potentially multigraphic sequences
• Recognition of split-graphic sequences
• The condition for a sequence to be potentially \(A_{L,M}\)-graphic
• Graphic sequences and split graphs
• Potentially graphic sequences of split graphs

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

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4898764)