Hadwiger's Conjecture for Proper Circular Arc Graphs

Thumbnail Image

Date

Authors

Journal Title

Journal ISSN

Volume Title

Publisher

Abstract

Description

Circular 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.
18 pages, 2 figures

Keywords

Combinatorics, 05C83;05C15;05C10

Citation

URI

http://salesiana.dossiersoluciones.com/handle/123456789/112848

Consulte el texto completo en el siguiente enlace:

https://arxiv.org/abs/math/0605503
 http://arxiv.org/abs/math/0605503

Collections

arXiv