Collapsible subgraphs of a 4-edge-connected graph

DOI10.1016/J.DAM.2019.01.033MaRDI QIDQ1741521zbMATH OpenOpenAlexWikidataFDO

Authors 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

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

Recommendations

• scientific article; zbMATH DE number 4055653
• scientific article; zbMATH DE number 4139791
• Properties of Catlin's reduced graphs and supereulerian graphs
• Forbidden subgraphs for collapsible graphs and supereulerian graphs
• Super-Eulerian graphs, collapsible graphs and matchings

Cites work

• A Note on Sub-Eulerian Graphs
• A Reduction Method for Edge-Connectivity in Graphs
• A note on graphs spanned by Eulerian graphs
• A reduction method to find spanning Eulerian subgraphs
• Characterization of removable elements with respect to having \(k\) disjoint bases in a matroid
• Comments on bases in dependence structures
• Edge-Disjoint Spanning Trees of Finite Graphs
• Edge-connectivity and edge-disjoint spanning trees
• Eine gemeinsame Basis für die Theorie der Eulerschen Graphen und den Satz von Petersen
• Graph theory
• Graphs without spanning closed trails
• On the Problem of Decomposing a Graph into n Connected Factors
• Supereulerian graphs: A survey
• The spanning subgraphs of eulerian graphs

Cited in

(3)

• scientific article; zbMATH DE number 7085087 (Why is no real title available?)
• On \(( s , t )\)-supereulerian graphs with linear degree bounds
• Polynomially determine if a graph is \((s,3)\)-supereulerian

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

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