An extremal problem on potentially K_p,1,1-graphic sequences

zbMATH Open1153.05021MaRDI QIDQ5387652FDOQ5387652

Authors Chunhui Lai

Publication date 27 May 2008

Full work available at URL https://arxiv.org/abs/math/0408292

zbMATH Keywords

graphical sequence

Mathematics Subject Classification ID

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

Recommendations

• scientific article; zbMATH DE number 2246360
• An extremal problem on the potentially \(P_k\)-graphic sequences
• Potentially \(K_{1,1,t}\)-graphic sequences.
• The characterization for a graphic sequence to have a realization containing \(K _{1,1,s }\)
• A note on potentially \(K_{1,1,t}\)-graphic sequences

Cited in

(9)

• scientific article; zbMATH DE number 7403609 (Why is no real title available?)
• An extremal problem on the potentially \(K_{r,s,t}\)-graphic sequences
• Potentially \(K_{1,1,t}\)-graphic sequences.
• scientific article; zbMATH DE number 1293748 (Why is no real title available?)
• Potentially K m — G-graphical sequences: A survey
• The characterization for a graphic sequence to have a realization containing \(K _{1,1,s }\)
• scientific article; zbMATH DE number 2246360 (Why is no real title available?)
• On potentially \((K_5-H)\)-graphic sequences.
• Block avoiding point sequencings of partial Steiner systems

This page was built for publication: An extremal problem on potentially \(K_{p,1,1}\)-graphic sequences

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