Two sufficient conditions for a graphic sequence to have a realization with prescribed clique size

DOI10.1016/j.disc.2005.03.028zbMath1119.05025MaRDI QIDQ2581629

Jian Hua Yin, Jiong-Sheng Li

Publication date: 10 January 2006

Published in: Discrete Mathematics (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.disc.2005.03.028

zbMATH Keywords

graphic sequences; graphs with cliques

Mathematics Subject Classification ID

05C07: Vertex degrees

Related Items

A characterization for a graphic sequence to be potentially \(C_{r}\)-graphic, Graphic sequences with a realization containing a union of cliques, Graphic sequences with a realization containing a generalized friendship graph, Graphic sequences with a realization containing a complete multipartite subgraph, A variation of a conjecture due to Erdös and Sós, The smallest degree sum that yields potentially \(K_{r+1}-K_3\)-graphic sequences, On potentially K 5-H-graphic sequences, Potentially K m — G-graphical sequences: A survey, An Erdős-Stone Type Conjecture for Graphic Sequences, On potentially H-graphic sequences

Cites Work

• The Erdős-Jacobson-Lehel conjecture on potentially \(P_k\)-graphic sequence is true
• An extremal problem on the potentially \(P_k\)-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