The choice number versus the chromatic number for graphs embeddable on orientable surfaces
The electronic journal of combinatorics, Tome 28 (2021) no. 4
Cet article a éte moissonné depuis la source The Electronic Journal of Combinatorics website

Voir la notice de l'article

We show that for loopless $6$-regular triangulations on the torus the gap between the choice number and chromatic number is at most $2$. We also show that the largest gap for graphs embeddable in an orientable surface of genus $g$ is of the order $\Theta(\sqrt{g})$, and moreover for graphs with chromatic number of the order $o(\sqrt{g}/\log_{2}(g))$ the largest gap is of the order $o(\sqrt{g})$.
DOI : 10.37236/10263
Classification : 05C15, 05C10, 05C35, 05C75
Mots-clés : \(k\)-choosability, list chromatic number

Brahadeesh Sankarnarayanan  1   ; Niranjan Balachandran  1

1 Indian Institute of Technology Bombay
@article{10_37236_10263,
     author = {Brahadeesh Sankarnarayanan and Niranjan Balachandran},
     title = {The choice number versus the chromatic number for graphs embeddable on orientable surfaces},
     journal = {The electronic journal of combinatorics},
     year = {2021},
     volume = {28},
     number = {4},
     doi = {10.37236/10263},
     zbl = {1486.05101},
     url = {http://geodesic.mathdoc.fr/articles/10.37236/10263/}
}
TY  - JOUR
AU  - Brahadeesh Sankarnarayanan
AU  - Niranjan Balachandran
TI  - The choice number versus the chromatic number for graphs embeddable on orientable surfaces
JO  - The electronic journal of combinatorics
PY  - 2021
VL  - 28
IS  - 4
UR  - http://geodesic.mathdoc.fr/articles/10.37236/10263/
DO  - 10.37236/10263
ID  - 10_37236_10263
ER  - 
%0 Journal Article
%A Brahadeesh Sankarnarayanan
%A Niranjan Balachandran
%T The choice number versus the chromatic number for graphs embeddable on orientable surfaces
%J The electronic journal of combinatorics
%D 2021
%V 28
%N 4
%U http://geodesic.mathdoc.fr/articles/10.37236/10263/
%R 10.37236/10263
%F 10_37236_10263
Brahadeesh Sankarnarayanan; Niranjan Balachandran. The choice number versus the chromatic number for graphs embeddable on orientable surfaces. The electronic journal of combinatorics, Tome 28 (2021) no. 4. doi: 10.37236/10263

Cité par Sources :