The Choice Number Versus the Chromatic Number for Graphs Embeddable on Orientable Surfaces
-
Published:2021-12-17
Issue:4
Volume:28
Page:
-
ISSN:1077-8926
-
Container-title:The Electronic Journal of Combinatorics
-
language:
-
Short-container-title:Electron. J. Combin.
Author:
Sankarnarayanan Brahadeesh,Balachandran Niranjan
Abstract
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})$.
Publisher
The Electronic Journal of Combinatorics
Subject
Computational Theory and Mathematics,Geometry and Topology,Theoretical Computer Science,Applied Mathematics,Discrete Mathematics and Combinatorics
Cited by
2 articles.
订阅此论文施引文献
订阅此论文施引文献,注册后可以免费订阅5篇论文的施引文献,订阅后可以查看论文全部施引文献