Article ID Journal Published Year Pages File Type
5776832 Discrete Mathematics 2017 5 Pages PDF
Abstract
A graph G is k-choosable if it can be properly colored whenever every vertex has a list of at least k available colors. In the paper, it is proved that all planar graphs without intersecting 5-cycles are 4-choosable.
Keywords
Related Topics
Physical Sciences and Engineering Mathematics Discrete Mathematics and Combinatorics
Preview
Planar graphs without intersecting 5-cycles are 4-choosable
Authors
, ,