Spanning trails in essentially 4-edge-connected graphs

DOI10.1016/j.dam.2013.08.041zbMath1300.05154OpenAlexW2151916639MaRDI QIDQ741753

D. Kharzeev

Publication date: 12 September 2014

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

Full work available at URL: https://doi.org/10.1016/j.dam.2013.08.041

zbMATH Keywords

spanning trailcollapsibleessentially 4-edge-connected\(r\)-edge-Eulerian-connected

Mathematics Subject Classification ID

Connectivity (05C40)

Related Items (4)

Strengthened Ore conditions for \((s, t)\)-supereulerian graphs ⋮ Supereulerian width of dense graphs ⋮ On \(( s , t )\)-supereulerian graphs with linear degree bounds ⋮ Polynomially determine if a graph is \((s,3)\)-supereulerian

Cites Work

• Unnamed Item
• Supereulerian graphs in the graph family \(C_{2}(6,k)\)
• Spanning trails containing given edges
• Hamiltonian connectedness in 3-connected line graphs
• Graphs without spanning closed trails
• A note on graphs spanned by Eulerian graphs
• A reduction method to find spanning Eulerian subgraphs
• The spanning subgraphs of eulerian graphs
• A Note on Sub-Eulerian Graphs
• Reflections on graph theory
• On Eulerian and Hamiltonian Graphs and Line Graphs
• Supereulerian graphs and the Petersen graph

This page was built for publication: Spanning trails in essentially 4-edge-connected graphs