 |
 |
|
|
| HAL: hal-00631398, version 1 |
| arXiv: 1110.2650 |
| Detailed view |  Export this paper |
 |
|
|
| Every triangle-free induced subgraph of the triangular lattice is $(5m,2m)$-choosable |
|
|
| Yves Aubry 1, 2Jean-Christophe Godin 2 |
|
|
| (2011-10-10) |
|
|
|
| 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\ge 1$, every finite triangle-free induced subgraph of the triangular lattice is $(5m,2m)$-choosable. |
|
|
|
|
|
|
|
|
|
|
|
| 1: | Institut de Mathématiques de Luminy (IML) |
|
|
|
CNRS : UPR9016 |
|
|
| 2: | Institut de Mathématiques de Toulon et du Var (IMATH) |
|
|
|
Université Sud Toulon Var : EA2134 |
|
|
| 3: | Laboratoire Electronique, Informatique et Image (Le2i) |
|
|
|
Université de Bourgogne – Arts et Métiers ParisTech – CNRS : UMR6306 |
|
|
|
|
|
|
|
|
|
| Subject | : | Mathematics/Combinatorics |
|
|
| Radio channel assignment – triangular lattice – choosability – weighted graph. |
|
|
|
| Attached file list to this document: | ||||||||||
|
||||||||||
|
|
|
| hal-00631398, version 1 | |
| http://hal.archives-ouvertes.fr/hal-00631398 | |
| oai:hal.archives-ouvertes.fr:hal-00631398 | |
| From: Yves Aubry | |
| Submitted on: Wednesday, 12 October 2011 11:44:35 | |
| Updated on: Wednesday, 12 October 2011 15:11:39 | |
