Hadwiger's conjecture for quasi-line graphs

DOI10.1002/jgt.20321zbMath1175.05120OpenAlexW4249035196WikidataQ123265051 ScholiaQ123265051MaRDI QIDQ3528157

Maria Chudnovsky, Alexandra Ovetsky Fradkin

Publication date: 8 October 2008

Published in: Journal of Graph Theory (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1002/jgt.20321

zbMATH Keywords

minorsclaw-free graphsHadwiger's conjecturequasi line graph

Mathematics Subject Classification ID

Small world graphs, complex networks (graph-theoretic aspects) (05C82) Graph minors (05C83)

Related Items (15)

Hadwiger's conjecture for squares of 2-trees ⋮ Some remarks on even-hole-free graphs ⋮ Hadwiger's Conjecture for Graphs with Forbidden Holes ⋮ Asymptotics of the chromatic number for quasi-line graphs ⋮ Weakening total coloring conjecture and Hadwiger's conjecture on total graphs ⋮ Hadwiger's Conjecture for the Complements of Kneser Graphs ⋮ An approximate version of Hadwiger's conjecture for claw-free graphs ⋮ Hadwiger's conjecture for inflations of 3-chromatic graphs ⋮ Clique immersions in graphs of independence number two with certain forbidden subgraphs ⋮ Hadwiger's conjecture for 3-arc graphs ⋮ Hadwiger’s Conjecture and Squares of Chordal Graphs ⋮ Erdős-Lovász Tihany conjecture for graphs with forbidden holes ⋮ Clique minors in claw-free graphs ⋮ The Erdős-Lovász tihany conjecture for quasi-line graphs ⋮ Total coloring of quasi-line graphs and inflated graphs

Cites Work

• Unnamed Item
• Claw-free graphs. III: Circular interval graphs
• Every planar map is four colorable. I: Discharging
• Every planar map is four colorable. II: Reducibility
• Hadwiger's conjecture for line graphs
• Claw-free graphs. VII. Quasi-line graphs
• Coloring quasi-line graphs

This page was built for publication: Hadwiger's conjecture for quasi-line graphs