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

zbMATH Open1153.05021arXivmath/0408292MaRDI QIDQ5387652FDOQ5387652

Authors: Chunhui Lai 

Publication date: 27 May 2008

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

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

zbMATH Keywords

graphical sequence

Mathematics Subject Classification ID

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

Cited In (9)

• Title not available (Why is that?)
• The characterization for a graphic sequence to have a realization containing \(K _{1,1,s }\)
• Title not available (Why is that?)
• An extremal problem on the potentially \(K_{r,s,t}\)-graphic sequences
• Potentially K m — G-graphical sequences: A survey
• Potentially \(K_{1,1,t}\)-graphic sequences.
• Title not available (Why is that?)
• Block avoiding point sequencings of partial Steiner systems
• On potentially \((K_5-H)\)-graphic sequences.

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)