Supereulerian graphs with width \(s\) and \(s\)-collapsible graphs

DOI10.1016/j.dam.2015.07.013zbMath1329.05181OpenAlexW1204150362MaRDI QIDQ906435

Hong-Jian Lai, Ping Li, Hao Li, Herbert Fleischner, Ye Chen

Publication date: 21 January 2016

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

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

zbMATH Keywords

super-Eulerian graphsedge connectivitycollapsible graphs\(s\)-collapsible graphsedge-disjoint trailsEulerian-connected graphssuper-Eulerian graphs with width \(s\)super-Eulerian width of a graph

Mathematics Subject Classification ID

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

Related Items (9)

Packing spanning trees in highly essentially connected graphs ⋮ On spanning disjoint paths in line graphs ⋮ Supereulerian width of dense graphs ⋮ Polynomially determining spanning connectivity of locally connected line graphs ⋮ Spanning trails with maximum degree at most 4 in \(2K_2\)-free graphs ⋮ Spanning 3-connected index of graphs ⋮ Chvátal-Erdős conditions and almost spanning trails ⋮ On \(s\)-Hamiltonicity of net-free line graphs ⋮ Complete family reduction and spanning connectivity in line graphs

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• On hamiltonian line graphs and connectivity
• Spanning trails containing given edges
• Degree conditions for group connectivity
• Edge-connectivity and edge-disjoint spanning trees
• Hamiltonian connectedness in 3-connected line graphs
• Graphs without spanning closed trails
• Connectivity and edge-disjoint spanning trees
• A note on graphs spanned by Eulerian graphs
• On the Problem of Decomposing a Graph into n Connected Factors
• Edge-Disjoint Spanning Trees of Finite Graphs
• Contractions and hamiltonian line 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
• Decomposition of Finite Graphs Into Forests

This page was built for publication: Supereulerian graphs with width \(s\) and \(s\)-collapsible graphs