an:06258987
Zbl 1283.05182
Aubry, Yves; Godin, Jean-Christophe; Togni, Olivier
Every triangle-free induced subgraph of the triangular lattice is \((5m,2m)\)-choosable
EN
Discrete Appl. Math. 166, 51-58 (2014).
00329420
2014
j
05C60 05C22 94A12
radio channel assignment; triangular lattice; choosability; weighted graph
Summary: A graph \(G\) is \((a,b)\)-choosable if for any color list of size \(a\) associated with each vertex, one can choose a subset of \(b\) colors such that adjacent vertices are colored with disjoint color sets. This paper proves that for any integer \(m\geq 1\), every finite triangle-free induced subgraph of the triangular lattice is \((5m,2m)\)-choosable.