6533b855fe1ef96bd12b10b7
RESEARCH PRODUCT
Every triangle-free induced subgraph of the triangular lattice is(5m,2m)-choosable
Olivier TogniYves AubryJean-christophe Godinsubject
Discrete mathematicsMathematics::CombinatoricsApplied Mathematics010102 general mathematicsInduced subgraphNeighbourhood (graph theory)0102 computer and information sciencesDisjoint sets01 natural sciencesGraphVertex (geometry)CombinatoricsComputer Science::Discrete Mathematics010201 computation theory & mathematicsDiscrete Mathematics and CombinatoricsHexagonal lattice0101 mathematicsMathematicsdescription
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.
| year | journal | country | edition | language |
|---|---|---|---|---|
| 2014-03-01 | Discrete Applied Mathematics |