Hadwiger's conjecture and squares of chordal graphs

DOI10.1007/978-3-319-42634-1_34MaRDI QIDQ2817883zbMATH OpenOpenAlexFDO

Authors L. Sunil Chandran, Davis Issac, Sanming Zhou

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

zbMATH Keywords

Hadwiger's conjectureminors2-treessquare graphs

Mathematics Subject Classification ID

Vertex subsets with special properties (dominating sets, independent sets, cliques, etc.) (05C69) Coloring of graphs and hypergraphs (05C15) Graph minors (05C83)

Recommendations

• Hadwiger's conjecture for squares of 2-trees
• An approximate version of Hadwiger's conjecture for claw-free graphs
• Hadwiger's conjecture for the complements of Kneser graphs
• A note on the Hadwiger number of circular arc graphs
• Hadwiger's conjecture for graphs with forbidden holes

Cites work

• scientific article; zbMATH DE number 3102312 (Why is no real title available?)
• Any 7-chromatic graph has \(K_7\) or \(K_{4,4}\) as a minor
• Approximation algorithms for intersection graphs
• Every planar map is four colorable. I: Discharging
• Every planar map is four colorable. II: Reducibility
• Hadwiger number and the Cartesian product of graphs
• Hadwiger's conjecture for \(K_ 6\)-free graphs
• Hadwiger's conjecture for line graphs
• Hadwiger's conjecture for powers of cycles and their complements
• Hadwiger's conjecture for proper circular arc graphs
• Hadwiger's conjecture for quasi-line graphs
• Hadwiger's conjecture is true for almost every graph

Cited in

(2)

• Hadwiger's conjecture for squares of 2-trees
• The square of a chordal graph

This page was built for publication: Hadwiger's conjecture and squares of chordal graphs

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2817883)