The smallest degree sum that yields potentially \(_{k}C_{\ell}\)-graphic sequences

DOI10.1016/S0012-365X(03)00137-7zbMath1029.05036MaRDI QIDQ1406566

Jiong-Sheng Li, Guo-Liang Chen, Jian Hua Yin

Publication date: 4 September 2003

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

zbMATH Keywords

degree sequence

Mathematics Subject Classification ID

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

Related Items (2)

Potentially K m — G-graphical sequences: A survey ⋮ On the potential function of an arbitrary graph \(H\)

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• A variation of an extremal theorem due to Woodall
• The Erdős-Jacobson-Lehel conjecture on potentially \(P_k\)-graphic sequence is true
• Algorithms for constructing graphs and digraphs with given valences and factors
• Sufficient Conditions for Circuits in Graphs^†

This page was built for publication: The smallest degree sum that yields potentially \(_{k}C_{\ell}\)-graphic sequences