Hadwiger’s Conjecture and Squares of Chordal Graphs
From MaRDI portal
Publication:2817883
DOI10.1007/978-3-319-42634-1_34zbMath1479.05286OpenAlexW2296180642MaRDI QIDQ2817883
L. Sunil Chandran, Sanming Zhou, Davis Issac
Publication date: 2 September 2016
Published in: Lecture Notes in Computer Science (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/978-3-319-42634-1_34
Coloring of graphs and hypergraphs (05C15) Graph minors (05C83) Vertex subsets with special properties (dominating sets, independent sets, cliques, etc.) (05C69)
Cites Work
- Unnamed Item
- Approximation algorithms for intersection graphs
- Hadwiger's conjecture for powers of cycles and their complements
- Hadwiger number and the Cartesian product of graphs
- Hadwiger's conjecture for proper circular arc graphs
- Hadwiger's conjecture is true for almost every 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
- Hadwiger's conjecture for line graphs
- Any 7-chromatic graph has \(K_7\) or \(K_{4,4}\) as a minor
- Hadwiger's conjecture for quasi-line graphs