Extended core and choosability of a graph

Details Extended core and choosability of a graph Extended core and choosability of a graph

2010-06-15

arxiv.org/abs/1006.2958v1

Computer Science

Discrete Mathematics

10 pages

Scientific paper

A graph $G$ is $(a,b)$-choosable if for any color list of size $a$ associated with each vertices, one can choose a subset of $b$ colors such that adjacent vertices are colored with disjoint color sets. This paper shows an equivalence between the $(a,b)$-choosability of a graph and the $(a,b)$-choosability of one of its subgraphs called the extended core. As an application, this result allows to prove the $(5,2)$-choosability and $(7,3)$-colorability of triangle-free induced subgraphs of the triangular lattice.

Affiliated with

Also associated with

No associations

Rating

Extended core and choosability of a graph 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 Extended core and choosability of a graph, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Extended core and choosability of a graph will most certainly appreciate the feedback.

Rate now

Comments { 0 }

Profile ID: LFWR-SCP-O-104963