On 3-edge-connected supereulerian graphs

DOI10.1007/s00373-010-0974-1zbMath1235.05084OpenAlexW2030148137MaRDI QIDQ659686

Hong-Jian Lai, Mingquan Zhan, Hao Li, Yehong Shao

Publication date: 24 January 2012

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

Full work available at URL: https://doi.org/10.1007/s00373-010-0974-1

zbMATH Keywords

line graphsupereulerian graphs3-edge-connected graph4-edge-connected graph5-edge-connencted graphspanning eulerian subgraph

Mathematics Subject Classification ID

Connectivity (05C40) Eulerian and Hamiltonian graphs (05C45)

Cites Work

• On hamiltonian line graphs and connectivity
• Graphs without spanning closed trails
• On a closure concept in claw-free 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
• Reflections on graph theory

This page was built for publication: On 3-edge-connected supereulerian graphs