Geodesic
8-star-choosability of a graph with maximum average degree less than 3
Discrete mathematics & theoretical computer science, Tome 13 (2011) no. 3.

Voir la notice de l'article provenant de la source Episciences

Graphs and Algorithms 
@article{DMTCS_2011_13_3_a10,
     author = {Chen, Min and Raspaud, Andr\'e and Wang, Weifan},
     title = {8-star-choosability of a graph with maximum average degree less than 3},
     journal = {Discrete mathematics & theoretical computer science},
     publisher = {mathdoc},
     volume = {13},
     number = {3},
     year = {2011},
     doi = {10.46298/dmtcs.561},
     language = {en},
     url = {http://geodesic.mathdoc.fr/articles/10.46298/dmtcs.561/}
}
TY  - JOUR
AU  - Chen, Min
AU  - Raspaud, André
AU  - Wang, Weifan
TI  - 8-star-choosability of a graph with maximum average degree less than 3
JO  - Discrete mathematics & theoretical computer science
PY  - 2011
VL  - 13
IS  - 3
PB  - mathdoc
UR  - http://geodesic.mathdoc.fr/articles/10.46298/dmtcs.561/
DO  - 10.46298/dmtcs.561
LA  - en
ID  - DMTCS_2011_13_3_a10
ER  - 
%0 Journal Article
%A Chen, Min
%A Raspaud, André
%A Wang, Weifan
%T 8-star-choosability of a graph with maximum average degree less than 3
%J Discrete mathematics & theoretical computer science
%D 2011
%V 13
%N 3
%I mathdoc
%U http://geodesic.mathdoc.fr/articles/10.46298/dmtcs.561/
%R 10.46298/dmtcs.561
%G en
%F DMTCS_2011_13_3_a10
Chen, Min; Raspaud, André; Wang, Weifan. 8-star-choosability of a graph with maximum average degree less than 3. Discrete mathematics & theoretical computer science, Tome 13 (2011) no. 3. doi : 10.46298/dmtcs.561. http://geodesic.mathdoc.fr/articles/10.46298/dmtcs.561/

Cité par Sources :