On the structure of \(k\)-connected graphs without \(K_{k}\)-minor
From MaRDI portal
Publication:1767621
DOI10.1016/j.ejc.2004.01.011zbMath1057.05074OpenAlexW1984262059MaRDI QIDQ1767621
Jianbing Niu, Rong Luo, Cun-Quan Zhang, Ken-ichi Kawarabayashi
Publication date: 8 March 2005
Published in: European Journal of Combinatorics (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.ejc.2004.01.011
Related Items
Some recent progress and applications in graph minor theory ⋮ Properties of 8-contraction-critical graphs with no \(K_7\) minor ⋮ Cliques, minors and apex graphs
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Graph minors. XX: Wagner's conjecture
- Über die Maximalzahl kreuzungsfreier H-Wege
- Every planar map is four colorable. I: Discharging
- Every planar map is four colorable. II: Reducibility
- Hadwiger's conjecture for \(K_ 6\)-free graphs
- The four-colour theorem
- Graph minors. XVI: Excluding a non-planar graph
- The extremal function for complete minors
- Any 7-chromatic graph has \(K_7\) or \(K_{4,4}\) as a minor
- Homomorphiesätze für Graphen
- Homomorphieeigenschaften und mittlere Kantendichte von Graphen
- Über einen Satz von K.Wagner zum Vierfarbenproblem
- Beweis einer Abschwächung der Hadwiger-Vermutung
- On separating sets of edges in contraction-critical graphs
- Graphs with forbidden subgraphs
- An extremal function for contractions of graphs
- Contractions to k8
- A Property of 4-Chromatic Graphs and some Remarks on Critical Graphs
This page was built for publication: On the structure of \(k\)-connected graphs without \(K_{k}\)-minor