Free choosability of outerplanar graphs - Archive ouverte HAL Accéder directement au contenu
Article Dans Une Revue Graphs and Combinatorics Année : 2016

Free choosability of outerplanar graphs

Résumé

A graph $G$ is free $(a,b)$-choosable if for any vertex $v$ with $b$ colors assigned and for any list of colors of size $a$ associated with each vertex $u\ne v$, the coloring can be completed by choosing for $u$ a subset of $b$ colors such that adjacent vertices are colored with disjoint color sets. In this note, a necessary and sufficient condition for a cycle to be free $(a,b)$-choosable is given. As a corollary, some choosability results are derived for graphs in which cycles are connected by a tree structure.
Fichier principal
Vignette du fichier
freechooscycle.pdf (108.6 Ko) Télécharger le fichier
Origine : Fichiers produits par l'(les) auteur(s)
Loading...

Dates et versions

hal-00957298 , version 1 (10-03-2014)

Identifiants

Citer

Yves Aubry, Jean-Christophe Godin, Olivier Togni. Free choosability of outerplanar graphs. Graphs and Combinatorics, 2016, 32 (3), pp.851-859. ⟨10.1007/s00373-015-1625-3⟩. ⟨hal-00957298⟩
401 Consultations
214 Téléchargements

Altmetric

Partager

Gmail Facebook X LinkedIn More