Hadwiger's Conjecture for Graphs with Forbidden Holes
From MaRDI portal
Publication:5348213
DOI10.1137/16M1086236zbMath1368.05141arXiv1607.06718OpenAlexW2964259760WikidataQ123151267 ScholiaQ123151267MaRDI QIDQ5348213
No author found.
Publication date: 14 August 2017
Published in: SIAM Journal on Discrete Mathematics (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/1607.06718
Coloring of graphs and hypergraphs (05C15) Graph minors (05C83) Graph operations (line graphs, products, etc.) (05C76)
Related Items
Some remarks on even-hole-free graphs, Clique immersions in graphs of independence number two with certain forbidden subgraphs, Erdős-Lovász Tihany conjecture for graphs with forbidden holes, A note on Hadwiger's conjecture for \(W_5\)-free graphs with independence number two
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- On Seymour's strengthening of Hadwiger's conjecture for graphs with certain forbidden subgraphs
- The strong perfect graph theorem
- Some remarks on the odd Hadwiger's conjecture
- The Erdős-Lovász tihany conjecture for quasi-line graphs
- A bound on the chromatic number of a graph
- 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
- Hadwiger's conjecture for line graphs
- Claw-free graphs. VII. Quasi-line graphs
- Any 7-chromatic graph has \(K_7\) or \(K_{4,4}\) as a minor
- Coloring graphs with forbidden minors
- Hadwiger’s Conjecture
- Coloring quasi-line graphs
- Hadwiger's conjecture for quasi-line graphs
- An approximate version of Hadwiger's conjecture for claw-free graphs
- On a certain homomorphism properties of graphs II.
- On triangles in ‐minor free graphs
- Clique minors in double‐critical graphs
- On a special case of Hadwiger's conjecture
- On Certain Homomorphism Properties of Graphs I.
- A Property of 4-Chromatic Graphs and some Remarks on Critical Graphs
