Every triangle-free induced subgraph of the triangular lattice is $(5m,2m)$-choosable
Combinatorics
2011-10-13 v1
Abstract
A graph is -choosable if for any color list of size associated with each vertex, one can choose a subset of colors such that adjacent vertices are colored with disjoint color sets. This paper proves that for any integer , every finite triangle-free induced subgraph of the triangular lattice is -choosable.
Cite
@article{arxiv.1110.2650,
title = {Every triangle-free induced subgraph of the triangular lattice is $(5m,2m)$-choosable},
author = {Yves Aubry and Jean-Christophe Godin and Olivier Togni},
journal= {arXiv preprint arXiv:1110.2650},
year = {2011}
}