Every triangle-free induced subgraph of the triangular lattice is $(5m,2m)$-choosable

Details Every triangle-free induced subgraph of the triangular lattice is $(5m,2m)$-choosable Every triangle-free induced subgraph of the triangular lattice is $(5m,2m)$-choosable

2011-10-12

arxiv.org/abs/1110.2650v1

Mathematics

Combinatorics

Scientific paper

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.

Affiliated with

Also associated with

No associations

Rating

Every triangle-free induced subgraph of the triangular lattice is $(5m,2m)$-choosable does not yet have a rating. At this time, there are no reviews or comments for this scientific paper.

If you have personal experience with Every triangle-free induced subgraph of the triangular lattice is $(5m,2m)$-choosable, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Every triangle-free induced subgraph of the triangular lattice is $(5m,2m)$-choosable will most certainly appreciate the feedback.

Rate now

Comments { 0 }

Profile ID: LFWR-SCP-O-633795