Planar graphs without pairwise adjacent 3,4,5, and 6cycle are 4choosable
Abstract
Xu and Wu proved that if every 5cycle of a planar graph G is not simultaneously adjacent to 3cycles and 4cycles, then G is 4choosable. In this paper, we improve this result as follows. If G is a planar graph without pairwise adjacent 3,4,5, and 6cycle, then G is 4choosable.
 Publication:

arXiv eprints
 Pub Date:
 December 2018
 arXiv:
 arXiv:1812.10473
 Bibcode:
 2018arXiv181210473S
 Keywords:

 Mathematics  Combinatorics;
 Computer Science  Discrete Mathematics;
 05C15
 EPrint:
 17 pages and 2 figures