A note on the Hadwiger number of circular arc graphs

Abstract. The intention of this note is to motivate the researchers to study Hadwiger’s conjecture for circular arc graphs. Let η(G) denote the largest clique minor of a graph G, and let χ(G) denote its chromatic number. Hadwiger’s conjecture states that η(G) ≥ χ(G) and is one of the most important and difficult open problems in graph theory. From the point of view of researchers who are sceptical of the validity of the conjecture, it is interesting to study the conjecture for graph classes where η(G) is guaranteed not to grow too fast with respect to χ(G), since such classes of graphs are indeed a reasonable place to look for possible counterexamples. We show that in any circular arc graph G, η(G) ≤ 2χ(G) − 1, and there is a family with equality. So, it makes sense to study Hadwiger’s conjecture for this family. Key words. circular arc, Hadwiger’s conjecture, minor, graph coloring

• Type: Journal
• Year: 2007
• Where: IPL
• Authors: N. S. Narayanaswamy, Naveen Belkale, L. Sunil Chandran, Naveen Sivadasan
• Keywords: Circular Arc Graph, Conjecture, Difficult Open Problems, IPL 2006, IPL 2007