Article ID | Journal | Published Year | Pages | File Type |
---|---|---|---|---|
5777223 | Electronic Notes in Discrete Mathematics | 2016 | 5 Pages |
Abstract
We consider list coloring of planar graphs without cycles of length in {4, â¦, 8}. List coloring is a generalization of the classical vertex coloring problem where each vertex has a list of colors associated with it. The goal is to proper vertex color the graph, such that each vertex gets a color available in its list. In this note, we prove that it is possible to 3-list color planar graphs without cycles of length in {4, â¦, 8} and with restrictions on 9-cycles.
Related Topics
Physical Sciences and Engineering
Mathematics
Discrete Mathematics and Combinatorics
Authors
Sreekanth Gorla, Meghana Nasre,