Cliques, minors and apex graphs
From MaRDI portal
Publication:1043579
DOI10.1016/j.disc.2008.12.009zbMath1211.05122OpenAlexW2084842546MaRDI QIDQ1043579
Publication date: 9 December 2009
Published in: Discrete Mathematics (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.disc.2008.12.009
Coloring of graphs and hypergraphs (05C15) Graph minors (05C83) Vertex subsets with special properties (dominating sets, independent sets, cliques, etc.) (05C69)
Related Items (1)
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Disjoint paths in graphs
- 2-linked graphs
- Ü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
- On the structure of \(k\)-connected graphs without \(K_{k}\)-minor
- Any 7-chromatic graph has \(K_7\) or \(K_{4,4}\) as a minor
- The extremal function for \(K_{9}\) minors
- Homomorphiesätze für Graphen
- Homomorphieeigenschaften und mittlere Kantendichte von Graphen
- On separating sets of edges in contraction-critical graphs
- Graphs with forbidden subgraphs
- Über eine Eigenschaft der ebenen Komplexe
- Contractions to k8
- A Property of 4-Chromatic Graphs and some Remarks on Critical Graphs
This page was built for publication: Cliques, minors and apex graphs