Degree sequence and supereulerian graphs

DOI10.1016/j.disc.2007.11.008zbMath1165.05005OpenAlexW2073010775MaRDI QIDQ998406

Hong-Jian Lai, Suohai Fan, Taoye Zhang, Ju Zhou, Yehong Shao

Publication date: 28 January 2009

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

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

zbMATH Keywords

degree sequenceHamiltonian line graphssupereulerian graphscollapsible graphs

Mathematics Subject Classification ID

Eulerian and Hamiltonian graphs (05C45) Vertex degrees (05C07)

Related Items (3)

Realizing degree sequences as \(Z_3\)-connected graphs ⋮ Degree sequences and graphs with disjoint spanning trees ⋮ Multigraphic degree sequences and supereulerian graphs, disjoint spanning trees

Cites Work

• Unnamed Item
• Algorithms for constructing graphs and digraphs with given valences and factors
• Nowhere-zero 4-flows; simultaneous edge-colorings; and critical partial Latin squares
• A remark on the existence of finite graphs
• A reduction method to find spanning Eulerian subgraphs
• On Realizability of a Set of Integers as Degrees of the Vertices of a Linear Graph. I
• On Eulerian and Hamiltonian Graphs and Line Graphs
• Existence of k-edge connected ordinary graphs with prescribed degrees

This page was built for publication: Degree sequence and supereulerian graphs