Contractible non-edges in \(3\)-connected graphs
type: Item
instance of: scholarly article
title: Contractible non-edges in \(3\)-connected graphs
zbMATH Open document ID: 1027.05054
author: Matthias Kriesell
published in: Journal of Combinatorial Theory. Series B
publication date: 2000-06-25T00:00:00Z
Mathematics Subject Classification ID: 05C40
zbMATH DE Number: 1464267
zbMATH Keywords: reduction theorem
zbMATH Keywords: connected subgraphs
MaRDI profile type: Publication
full work available at URL: jctb.1998.1842
OpenAlex ID: W2025296046
cites work: Contractible edges in 3-connected graphs
cites work: Distribution of contractible edges in k-connected graphs
cites work: Covering contractible edges in 3‐connected graphs. II. Characterizing those with covers of size three
cites work: Endlichkeitssätze für k-kritische Graphen
cites work: Generalizaions of critical connectivity of graphs
cites work: Covering contractible edges in 3‐connected graphs. I: Covers of size three are cutsets
cites work: Kuratowski's theorem
cites work: Q3284374
DOI: 10.1006/JCTB.1998.1842
Recommended article: Non-contractible edges in a 3-connected graph
Recommended article: Q3781783
Recommended article: Q4820536
Recommended article: Contractible edges in 3-connected graphs
Recommended article: Contractible non-edges in 3-connected infinite graphs
Recommended article: Contractible non-edges in triangle-free graphs
Recommended article: Q5377034
Recommended article: Contractible edges and contractible triangles in a 3-connected graph
Recommended article: Contractible edges in triangle-free graphs
Recommended article: Contractible Edges in 3-Connected Cubic Graphs
description: scientific article; zbMATH DE number 1464267