Collapsible subgraphs of a 4-edge-connected graph

DOI10.1016/j.dam.2019.01.033zbMath1409.05124OpenAlexW2917890842WikidataQ128346259 ScholiaQ128346259MaRDI QIDQ1741521

Xianqiang Yang

Publication date: 3 May 2019

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

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

zbMATH Keywords

edge connectivityreduction methodssupereulerian graphscollapsible graphsedge-disjoint spanning tress

Mathematics Subject Classification ID

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

Related Items (2)

On \(( s , t )\)-supereulerian graphs with linear degree bounds ⋮ Polynomially determine if a graph is \((s,3)\)-supereulerian

Cites Work

• Unnamed Item
• Characterization of removable elements with respect to having \(k\) disjoint bases in a matroid
• Edge-connectivity and edge-disjoint spanning trees
• Graphs without spanning closed trails
• Eine gemeinsame Basis für die Theorie der Eulerschen Graphen und den Satz von Petersen
• 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
• A reduction method to find spanning Eulerian subgraphs
• Supereulerian graphs: A survey
• The spanning subgraphs of eulerian graphs
• A Reduction Method for Edge-Connectivity in Graphs
• A Note on Sub-Eulerian Graphs
• Comments on bases in dependence structures

This page was built for publication: Collapsible subgraphs of a 4-edge-connected graph