Geodesic
Fractional coloring of triangle-free planar graphs
The electronic journal of combinatorics, Tome 22 (2015) no. 4
Cet article a éte moissonné depuis la source The Electronic Journal of Combinatorics website

Voir la notice de l'article

We prove that every planar triangle-free graph on $n$ vertices has fractional chromatic number at most $3-3/(3n+1)$.
DOI : 10.37236/4135
Classification : 05C15, 05C10, 05C72
Mots-clés : fractional colouring, planar graphs

Zdeněk Dvořák  1   ; Jean-Sébastien Sereni  2   ; Jan Volec  3

1 IÚUK
2 CNRS
3 DIMAP 
@article{10_37236_4135,
     author = {Zden\v{e}k Dvo\v{r}\'ak and Jean-S\'ebastien Sereni and Jan Volec},
     title = {Fractional coloring of triangle-free planar graphs},
     journal = {The electronic journal of combinatorics},
     year = {2015},
     volume = {22},
     number = {4},
     doi = {10.37236/4135},
     zbl = {1323.05045},
     url = {http://geodesic.mathdoc.fr/articles/10.37236/4135/}
}
TY  - JOUR
AU  - Zdeněk Dvořák
AU  - Jean-Sébastien Sereni
AU  - Jan Volec
TI  - Fractional coloring of triangle-free planar graphs
JO  - The electronic journal of combinatorics
PY  - 2015
VL  - 22
IS  - 4
UR  - http://geodesic.mathdoc.fr/articles/10.37236/4135/
DO  - 10.37236/4135
ID  - 10_37236_4135
ER  - 
%0 Journal Article
%A Zdeněk Dvořák
%A Jean-Sébastien Sereni
%A Jan Volec
%T Fractional coloring of triangle-free planar graphs
%J The electronic journal of combinatorics
%D 2015
%V 22
%N 4
%U http://geodesic.mathdoc.fr/articles/10.37236/4135/
%R 10.37236/4135
%F 10_37236_4135
Zdeněk Dvořák; Jean-Sébastien Sereni; Jan Volec. Fractional coloring of triangle-free planar graphs. The electronic journal of combinatorics, Tome 22 (2015) no. 4. doi: 10.37236/4135

Cité par Sources :