On extremal \(k\)-supereulerian graphs

DOI10.1016/j.disc.2013.09.003zbMath1277.05104OpenAlexW2170782213MaRDI QIDQ383349

Huiya Yan, Liang Sun, Zhaohong Niu, Hong-Jian Lai, Limning Xiong

Publication date: 3 December 2013

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

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

zbMATH Keywords

2-factorsupereulerian grapheven factor\(k\)-supereulerian graphreduced graph

Mathematics Subject Classification ID

Eulerian and Hamiltonian graphs (05C45)

Related Items

Even factors with a bounded number of components in iterated line graphs

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Supereulerian graphs in the graph family \(C_{2}(6,k)\)
• Spanning subgraph with Eulerian components
• Supereulerianity of \(k\)-edge-connected graphs with a restriction on small bonds
• The supereulerian graphs in the graph family \(C(l,k)\)
• Spanning eulerian subgraphs, the splitting lemma, and Petersen's theorem
• A note on minimum degree conditions for supereulerian graphs
• Eulerian subgraphs and Hamilton-connected line graphs
• A note on graphs spanned by Eulerian graphs
• A reduction method to find spanning Eulerian subgraphs
• Supereulerian graphs: A survey
• The spanning subgraphs of eulerian graphs
• A Note on Sub-Eulerian Graphs
• Maximum matching and a polyhedron with 0,1-vertices