Spanning Eulerian subgraphs of 2-edge-connected graphs

DOI10.1007/S00373-011-1108-0zbMath1263.05057OpenAlexW2063476570MaRDI QIDQ1950407

Xiangwen Li, Chunxiang Wang, Zhaohong Niu, Qiong Fan, Limning Xiong

Publication date: 13 May 2013

Published in: Graphs and Combinatorics (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/s00373-011-1108-0

zbMATH Keywords

Eulerian graphscollapsiblesupereulerian

Mathematics Subject Classification ID

Eulerian and Hamiltonian graphs (05C45)

Related Items (1)

Graphs with a 3-cycle-2-cover

Cites Work

• Supereulerian graphs in the graph family \(C_{2}(6,k)\)
• The supereulerian graphs in the graph family \(C(l,k)\)
• Graphs without spanning closed trails
• A note on minimum degree conditions for supereulerian graphs
• Eulerian subgraphs and Hamilton-connected line graphs
• A reduction method to find spanning Eulerian subgraphs
• A Note on Sub-Eulerian Graphs
• Unnamed Item
• Unnamed Item

This page was built for publication: Spanning Eulerian subgraphs of 2-edge-connected graphs