The characterization for a graphic sequence to have a realization containing \(K _{1,1,s }\)

DOI10.1007/s00373-011-1061-yzbMath1256.05053OpenAlexW2037354696MaRDI QIDQ1926036

Jian Hua Yin

Publication date: 27 December 2012

Published in: Graphs and Combinatorics (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/s00373-011-1061-y

zbMATH Keywords

degree sequencepotentially \(K _{1,1,s }\)-graphic sequence

Mathematics Subject Classification ID

Extremal problems in graph theory (05C35) Vertex degrees (05C07)

Related Items

A Rao-type characterization for a sequence to have a realization containing a split graph

Cites Work

• An extremal problem on potentially \(K_{r,s}\)-graphic sequences
• Algorithms for constructing graphs and digraphs with given valences and factors
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item