N. Alon, C. Mcdiarmid, and B. Reed, Star arboricity, Combinatorica, vol.39, issue.4, pp.375-380, 1992.
DOI : 10.1007/BF01305230

N. Alon and M. Tarsi, Colorings and orientations of graphs, Combinatorica, vol.29, issue.2, pp.125-134, 1992.
DOI : 10.1007/BF01204715

H. Broersma, F. V. Fomin, P. A. Golovach, and G. J. Woeginger, Backbone Colorings for Networks, Proceedings of the 29th International Workshop on Graph-Theoretic Concepts in Computer Science (WG 2003), pp.2880131-142, 2003.
DOI : 10.1007/978-3-540-39890-5_12

H. Broersma, F. V. Fomin, P. A. Golovach, and G. J. Woeginger, Backbone colorings for graphs: Tree and path backbones, Journal of Graph Theory, vol.94, issue.2, pp.137-152, 2007.
DOI : 10.1002/jgt.20228

H. J. Broersma, J. Fujisawa, L. Marchal, D. Paulusma, A. N. Salman et al., <mml:math altimg="si11.gif" display="inline" overflow="scroll" xmlns:xocs="http://www.elsevier.com/xml/xocs/dtd" xmlns:xs="http://www.w3.org/2001/XMLSchema" xmlns:xsi="http://www.w3.org/2001/XMLSchema-instance" xmlns="http://www.elsevier.com/xml/ja/dtd" xmlns:ja="http://www.elsevier.com/xml/ja/dtd" xmlns:mml="http://www.w3.org/1998/Math/MathML" xmlns:tb="http://www.elsevier.com/xml/common/table/dtd" xmlns:sb="http://www.elsevier.com/xml/common/struct-bib/dtd" xmlns:ce="http://www.elsevier.com/xml/common/dtd" xmlns:xlink="http://www.w3.org/1999/xlink" xmlns:cals="http://www.elsevier.com/xml/common/cals/dtd"><mml:mi>??</mml:mi></mml:math>-backbone colorings along pairwise disjoint stars and matchings, ?backbone colorings along pairwise disjoint stars and matchings, pp.5596-5609, 2009.
DOI : 10.1016/j.disc.2008.04.007

P. Erd?-os, A. L. Rubin, and H. Taylor, Choosability in graphs, Proceedings of the West Coast Conference on Combinatorics, Graph Theory and Computing Congress. Numer., XXVI, pp.125-157, 1979.

R. Evans and P. Montgomery, 6631, The American Mathematical Monthly, vol.98, issue.9, pp.870-872, 1991.
DOI : 10.2307/2324290

S. L. Hakimi, On the degrees of the vertices of a directed graph, Journal of the Franklin Institute, vol.279, issue.4, pp.290-308, 1965.
DOI : 10.1016/0016-0032(65)90340-6

F. Havet, R. Kang, T. Müller, and J. Sereni, Circular choosability, Journal of Graph Theory, vol.48, issue.3, pp.241-334, 2009.
DOI : 10.1002/jgt.20375
URL : https://hal.archives-ouvertes.fr/inria-00496432

F. Havet, A. D. King, M. Liedloff, and I. Todinca, (Circular) backbone coloring: tree backbones in planar graphs, INRIA Research Report, vol.8512, 2012.

D. D. Liu and X. Zhu, Multilevel Distance Labelings for Paths and Cycles, SIAM Journal on Discrete Mathematics, vol.19, issue.3, pp.610-621, 2005.
DOI : 10.1137/S0895480102417768

C. Mcdiarmid, On the span in channel assignment problems: bounds, computing and counting. Discrete Math, pp.387-397, 2003.

]. B. Mohar, Choosability for the circular chromatic number, 2003.

S. Norine, On two questions about circular choosability, Journal of Graph Theory, vol.48, issue.3, pp.261-269, 2008.
DOI : 10.1002/jgt.20309

S. Norine, T. Wong, and X. Zhu, Circular choosability via combinatorial Nullstellensatz, Journal of Graph Theory, vol.48, issue.3, pp.190-204, 2008.
DOI : 10.1002/jgt.20333

M. Tarsi, On the decomposition of a graph into stars, Discrete Mathematics, vol.36, issue.3, pp.299-304, 1981.
DOI : 10.1016/S0012-365X(81)80025-8

C. Thomassen, Every Planar Graph Is 5-Choosable, Journal of Combinatorial Theory, Series B, vol.62, issue.1, pp.180-181, 1994.
DOI : 10.1006/jctb.1994.1062

X. Zhu, Circular choosability of graphs, Journal of Graph Theory, vol.8, issue.3, pp.210-218, 2005.
DOI : 10.1002/jgt.20051