A note on the Hadwiger number of circular arc graphs

DOI10.1016/j.ipl.2007.04.008zbMath1183.05028OpenAlexW2071338764MaRDI QIDQ2379986

L. Sunil Chandran, N. S. Narayanaswamy, Naveen Sivadasan, Naveen Belkale

Publication date: 24 March 2010

Published in: Information Processing Letters (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.ipl.2007.04.008

zbMATH Keywords

minorgraph coloringcombinatorial problemscircular arcHadwiger's conjecture

Mathematics Subject Classification ID

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

Related Items (1)

Hadwiger's conjecture for proper circular arc graphs

Cites Work

• Unnamed Item
• Hadwiger's conjecture for proper circular arc graphs
• Hadwiger's conjecture for \(K_ 6\)-free graphs
• Über eine Eigenschaft der ebenen Komplexe
• Coloring a Family of Circular Arcs
• Connected matchings and Hadwiger's conjecture

This page was built for publication: A note on the Hadwiger number of circular arc graphs