A generalization of a conjecture due to Erdös, Jacobson and Lehel

DOI10.1016/J.DISC.2008.04.057zbMath1209.05059OpenAlexW2052971790WikidataQ123301357 ScholiaQ123301357MaRDI QIDQ1025530

Jian Hua Yin

Publication date: 19 June 2009

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

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

zbMATH Keywords

\(r\)-complete graph\(r\)-graph\(r\)-graphic sequence

Mathematics Subject Classification ID

Vertex degrees (05C07)

Related Items (3)

Recognition of split-graphic sequences ⋮ Conditions for \(r\)-graphic sequences to be potentially \(K^{(r)}_{m+1}\)-graphic ⋮ A sufficient condition for r - graphic sequences to be potentially

Cites Work

• Conditions for sequences to be r-graphic
• 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
• Some Properties of Graphs with Multiple Edges
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item

This page was built for publication: A generalization of a conjecture due to Erdös, Jacobson and Lehel