Almost all 3-connected graphs contain a contractible set of \(k\) vertices
type: Item
instance of: scholarly article
title: Almost all 3-connected graphs contain a contractible set of \(k\) vertices
zbMATH Open document ID: 1028.05056
author: Matthias Kriesell
published in: Journal of Combinatorial Theory. Series B
publication date: 2002-12-10T00:00:00Z
Mathematics Subject Classification ID: 05C40
Mathematics Subject Classification ID: 05C38
zbMATH DE Number: 1843796
zbMATH Keywords: connectivity
zbMATH Keywords: contractable subgraph
zbMATH Keywords: longest induced path
zbMATH Keywords: longest cycle
zbMATH Keywords: connected subgraph
MaRDI profile type: Publication
full work available at URL: jctb.2001.2060
OpenAlex ID: W1988376039
cites work: Q5422499
cites work: \((k,g)\)-cages are 3-connected
cites work: Q4342632
cites work: Contractible subgraphs in 3-connected graphs
cites work: Contractible triples in 3-connected graphs
cites work: Q3284374
DOI: 10.1006/JCTB.2001.2060
description: scientific article; zbMATH DE number 1843796