Hadwiger's Conjecture for Proper Circular Arc Graphs

Simple item page
dc.creatorBelkale, Naveen
dc.creatorChandran, L. Sunil
dc.date2006-05-18
dc.date2006-07-07
dc.date.accessioned2026-07-07T07:14:22Z
dc.date.available2026-07-07T07:14:22Z
dc.descriptionCircular arc graphs are graphs whose vertices can be represented as arcs on a circle such that any two vertices are adjacent if and only if their corresponding arcs intersect. Proper circular arc graphs are graphs which have a circular arc representation where no arc is completely contained in any other arc. Hadwiger's conjecture states that if a graph $G$ has chromatic number $k$, then a complete graph of $k$ vertices is a minor of $G$. We prove Hadwiger's conjecture for proper circular arc graphs.
dc.description18 pages, 2 figures
dc.identifierhttps://arxiv.org/abs/math/0605503
dc.identifierhttp://arxiv.org/abs/math/0605503
dc.identifier.urihttp://salesiana.dossiersoluciones.com/handle/123456789/112848
dc.subjectCombinatorics
dc.subject05C83;05C15;05C10
dc.titleHadwiger's Conjecture for Proper Circular Arc Graphs
dc.typetext

Files

Collections

arXiv