Every triangle-free induced subgraph of the triangular lattice is (5m,2m) ( 5 m , 2 m ) -choosable
A graph G G is (a,b) ( a , b ) -choosable if for any color list of size a a associated with each vertex, one can choose a subset of b b colors such that adjacent vertices are colored with disjoint color sets. This paper proves that for any integer m?1 m ? 1 , every finite triangle-free induced subgraph of the triangular lattice is (5m,2m) ( 5 m , 2 m ) -choosable.
triangular lattice radio channel assignment choosability weighted graph