Hadwiger's conjecture for squares of 2-trees
From MaRDI portal
Publication:1633613
DOI10.1016/j.ejc.2018.10.003zbMath1402.05035arXiv1603.03205OpenAlexW2899364936WikidataQ123078957 ScholiaQ123078957MaRDI QIDQ1633613
L. Sunil Chandran, Sanming Zhou, Davis Issac
Publication date: 20 December 2018
Published in: European Journal of Combinatorics (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/1603.03205
Related Items (1)
Cites Work
- Hadwiger's conjecture for 3-arc 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
- A bound on the total chromatic number
- Hadwiger's conjecture for \(K_ 6\)-free graphs
- Coloring the square of a \(K_{4}\)-minor free graph
- Labeling outerplanar graphs with maximum degree three
- 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
- Hadwiger Number of Graphs with Small Chordality
- Hadwiger's Conjecture for the Complements of Kneser Graphs
- Hadwiger's conjecture for quasi-line graphs
- Unnamed Item
This page was built for publication: Hadwiger's conjecture for squares of 2-trees
