Circular choosability - Inria - Institut national de recherche en sciences et technologies du numérique Accéder directement au contenu
Article Dans Une Revue Journal of Graph Theory Année : 2009

Circular choosability

Résumé

We study circular choosability, a notion recently introduced by Mohar and by Zhu. First, we provide a negative answer to a question of Zhu about circular cliques. We next prove that cch(G) = O(ch(G) + ln |V(G)|) for every graph G. We investigate a generalisation of circular choosability, the circular f-choosability, where f is a function of the degrees. We also consider the circular choice number of planar graphs. Mohar asked for the value of τ := sup {cch(G) : G is planar}, and we prove that 6<τ>8, thereby providing a negative answer to another question of Mohar. We also study the circular choice number of planar and outerplanar graphs with prescribed girth, and graphs with bounded density.
Fichier principal
Vignette du fichier
HKMS09.pdf (266.1 Ko) Télécharger le fichier
Origine : Fichiers produits par l'(les) auteur(s)
Loading...

Dates et versions

inria-00496432 , version 1 (01-07-2010)

Identifiants

Citer

Frédéric Havet, Ross Kang, Tobias Müller, Jean-Sébastien Sereni. Circular choosability. Journal of Graph Theory, 2009, 61 (4), pp.241--270. ⟨10.1002/jgt.20375⟩. ⟨inria-00496432⟩
215 Consultations
170 Téléchargements

Altmetric

Partager

Gmail Facebook X LinkedIn More