Typical subgraphs of 3- and 4-connected graphs
type: Item
instance of: scholarly article
title: Typical subgraphs of 3- and 4-connected graphs
zbMATH Open document ID: 0728.05041
author: Bogdan Oporowski
author: Robin Thomas
author: James Oxley
published in: Journal of Combinatorial Theory. Series B
publication date: 1993-01-01T00:00:00Z
review text: We prove that, for every positive integer k, there is an integer N such that every 3-connected graph with at least N vertices has a minor isomorphic to the k-spoke wheel or \(K_{3,k}\); and that every internally 4-connected graph with at least N vertices has a minor isomorphic to the 2k-spoke double wheel, the k-rung circular ladder, the k-rung Möbius ladder, or \(K_{4,k}\). We also prove an analogous result for infinite graphs.
Mathematics Subject Classification ID: 05C40
zbMATH DE Number: 4202298
zbMATH Keywords: connectivity
zbMATH Keywords: subdivision
zbMATH Keywords: minor
MaRDI profile type: Publication
full work available at URL: jctb.1993.1019
OpenAlex ID: W1971261527
DOI: 10.1006/JCTB.1993.1019
description: scientific article; zbMATH DE number 4202298