Contractible subgraphs in 3-connected graphs
type: Item
instance of: scholarly article
title: Contractible subgraphs in 3-connected graphs
zbMATH Open document ID: 1024.05051
author: Matthias Kriesell
published in: Journal of Combinatorial Theory. Series B
publication date: 2002-12-10T00:00:00Z
Mathematics Subject Classification ID: 05C40
zbMATH DE Number: 1843713
zbMATH Keywords: vertex connectivity
MaRDI profile type: Publication
OpenAlex ID: W2042939975
cites work: Contractible edges in 3-connected graphs
cites work: Q4342632
cites work: Zur Theorie der n-fach zusammenhängenden Graphen
cites work: Induced paths in 5-connected graphs
cites work: Generalizaions of critical connectivity of graphs
cites work: Contractible triples in 3-connected graphs
cites work: Edge-Disjoint Spanning Trees of Finite Graphs
cites work: On induced subgraphs of a block
cites work: Covering contractible edges in 3‐connected graphs. I: Covers of size three are cutsets
cites work: Graph decomposition with applications to subdivisions and path systems modulo k
cites work: Kuratowski's theorem
cites work: Q3284374
cites work: On the Problem of Decomposing a Graph into n Connected Factors
cites work: Q3751608
DOI: 10.1006/JCTB.2000.1960
Recommended article: Large contractible subgraphs of a 3-connected graph
Recommended article: Contractible subgraphs ink-connected graphs
Recommended article: Contractible edges in 3-connected graphs
Recommended article: Contractible triples in 3-connected graphs
Recommended article: Q3781783
Recommended article: Q4820536
Recommended article: Contractible circuits in \(3\)-connected graphs
Recommended article: Contractible non-edges in \(3\)-connected graphs
Recommended article: Contractible small subgraphs in \(k\)-connected graphs
Recommended article: Contractible Edges in 3-Connected Cubic Graphs
description: scientific article; zbMATH DE number 1843713