Collapsible subgraphs of a 4-edge-connected graph
type: Item
instance of: scholarly article
title: Collapsible subgraphs of a 4-edge-connected graph
zbMATH Open document ID: 1409.05124
author: Xianqiang Yang
published in: Discrete Applied Mathematics
publication date: 2019-05-03T00:00:00Z
Mathematics Subject Classification ID: 05C45
Mathematics Subject Classification ID: 05C40
zbMATH DE Number: 7051009
zbMATH Keywords: supereulerian graphs
zbMATH Keywords: collapsible graphs
zbMATH Keywords: edge-disjoint spanning tress
zbMATH Keywords: edge connectivity
zbMATH Keywords: reduction methods
MaRDI profile type: Publication
full work available at URL: j.dam.2019.01.033
OpenAlex ID: W2917890842
cites work: The spanning subgraphs of eulerian graphs
cites work: Q5422499
cites work: A reduction method to find spanning Eulerian subgraphs
cites work: Supereulerian graphs: A survey
cites work: Graphs without spanning closed trails
cites work: Edge-connectivity and edge-disjoint spanning trees
cites work: Eine gemeinsame Basis für die Theorie der Eulerschen Graphen und den Satz von Petersen
cites work: A Note on Sub-Eulerian Graphs
cites work: Characterization of removable elements with respect to having \(k\) disjoint bases in a matroid
cites work: A Reduction Method for Edge-Connectivity in Graphs
cites work: A note on graphs spanned by Eulerian graphs
cites work: Comments on bases in dependence structures
cites work: Edge-Disjoint Spanning Trees of Finite Graphs
cites work: On the Problem of Decomposing a Graph into n Connected Factors
Wikidata QID: Q128346259
DOI: 10.1016/J.DAM.2019.01.033
description: scientific article; zbMATH DE number 7051009