Every triangle-free induced subgraph of the triangular lattice is (5m, 2m)-choosable
| Affiliation auteurs | !!!! Error affiliation !!!! |
| Titre | Every triangle-free induced subgraph of the triangular lattice is (5m, 2m)-choosable |
| Type de publication | Journal Article |
| Year of Publication | 2014 |
| Auteurs | Aubry Y, Godin J-C, Togni O |
| Journal | DISCRETE APPLIED MATHEMATICS |
| Volume | 166 |
| Pagination | 51-58 |
| Date Published | MAR 31 |
| Type of Article | Article |
| ISSN | 0166-218X |
| Mots-clés | Choosability, Radio channel assignment, Triangular lattice, Weighted graph |
| Résumé | 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 > 1, every finite triangle-free induced subgraph of the triangular lattice is (5m, 2m)-choosable. (C) 2013 Elsevier B.V. All rights reserved. |
| DOI | 10.1016/j.dam.2013.09.028 |