\(K_{a,k}\) minors in graphs of bounded tree-width
type: Item
instance of: scholarly article
title: \(K_{a,k}\) minors in graphs of bounded tree-width
zbMATH Open document ID: 1024.05081
author: T. Böhme
author: John Maharry
author: Bojan Mohar
published in: Journal of Combinatorial Theory. Series B
publication date: 2002-12-10T00:00:00Z
Mathematics Subject Classification ID: 05C83
Mathematics Subject Classification ID: 05C40
zbMATH DE Number: 1843848
zbMATH Keywords: graph theory
zbMATH Keywords: graph minor
zbMATH Keywords: connectivity
MaRDI profile type: Publication
full work available at URL: jctb.2002.2119
OpenAlex ID: W2084271071
cites work: Highly linked graphs
cites work: Q3999150
cites work: Elimination of local bridges
cites work: Existenz n-fach zusammenhängender Teilgraphen in Graphen genügend großer Kantendichte
cites work: A characterization of graphs with no cube minor
cites work: An excluded minor theorem for the octahedron
cites work: Graph minors. IX: Disjoint crossed paths
cites work: Q3972953
cites work: Typical subgraphs of 3- and 4-connected graphs
cites work: Q4263662
DOI: 10.1006/JCTB.2002.2119
Recommended article: Graph minors. II. Algorithmic aspects of tree-width
Recommended article: Graph minors. III. Planar tree-width
Recommended article: \(K_{6}\) minors in 6-connected graphs of bounded tree-width
Recommended article: Tree-width and planar minors
Recommended article: Graph minors. IV: Tree-width and well-quasi-ordering
Recommended article: Rank-width and tree-width of \(H\)-minor-free graphs
Recommended article: Hitting Minors on Bounded Treewidth Graphs. I. General Upper Bounds
Recommended article: Minimum Fill-In and Treewidth of Split+ ke and Split+ kv Graphs
Recommended article: Hitting minors on bounded treewidth graphs. III. Lower bounds
Recommended article: On the excluded minor structure theorem for graphs of large tree-width
description: scientific article; zbMATH DE number 1843848