Supereulerian graphs with width s and s-collapsible graphs

DOI10.1016/J.DAM.2015.07.013zbMATH Open1329.05181OpenAlexW1204150362MaRDI QIDQ906435FDOQ906435

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

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

Recommendations

• Supereulerian width of dense graphs
• A note on collapsible graphs and super-Eulerian graphs
• scientific article; zbMATH DE number 19176
• Properties of Catlin's reduced graphs and supereulerian graphs
• scientific article

zbMATH Keywords

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

Mathematics Subject Classification ID

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

Cites Work

• Graph theory
• Graphs without spanning closed trails
• On the Problem of Decomposing a Graph into n Connected Factors
• Edge-Disjoint Spanning Trees of Finite Graphs
• A reduction method to find spanning Eulerian subgraphs
• Decomposition of Finite Graphs Into Forests
• A note on graphs spanned by Eulerian graphs
• Supereulerian graphs: A survey
• The spanning subgraphs of eulerian graphs
• Edge-connectivity and edge-disjoint spanning trees
• Hamiltonian connectedness in 3-connected line graphs
• A Note on Sub-Eulerian Graphs
• On hamiltonian line graphs and connectivity
• Graph theory and interconnection networks.
• Degree conditions for group connectivity
• Reinforcing the number of disjoint spanning trees
• Title not available (Why is that?)
• Connectivity and edge-disjoint spanning trees
• Title not available (Why is that?)
• Contractions and hamiltonian line graphs
• Spanning trails containing given edges

Cited In (11)

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

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

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q906435)