On potentially H-graphic sequences

DOI10.1007/S10587-007-0108-YzbMath1174.05024OpenAlexW1995805464MaRDI QIDQ3617982

Meng-Xiao Yin, Jian Hua Yin

Publication date: 31 March 2009

Published in: Czechoslovak Mathematical Journal (Search for Journal in Brave)

Full work available at URL: https://eudml.org/doc/31157

zbMATH Keywords

graphdegree sequencepotentially \(H\)-graphic sequence

Mathematics Subject Classification ID

Vertex degrees (05C07)

Related Items (2)

A characterization for a sequence to be potentially \({K_{r+1}-e}\)-graphic ⋮ Potentially K m — G-graphical sequences: A survey

Cites Work

• Unnamed Item
• Unnamed Item
• 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
• An extremal problem on potentially \(K_{r,s}\)-graphic sequences
• An extremal problem on the potentially \(P_k\)-graphic sequences
• Algorithms for constructing graphs and digraphs with given valences and factors
• Two sufficient conditions for a graphic sequence to have a realization with prescribed clique size

This page was built for publication: On potentially H-graphic sequences