Some conditions on 5-cycles that make planar graphs 4-choosable

arXiv1706.05141MaRDI QIDQ6287913FDOQ6287913

Authors: Pongpat Sittitrai, Kittikorn Nakprasit 

Publication date: 15 June 2017

Abstract: Consider two conditions on a graph: (1) each 5-cycle is not a subgraph of 5-wheel and does not share exactly one edge with 3-cycle, and (2) each 5-cycle is not adjacent to two 3-cycles and is not adjacent to a 4-cycle with chord. We show that if a planar graph $G$ satisfies one of the these conditions, then $G$ is 4-choosable. This yields that if each 5-cycle of a planar graph $G$ is not adjacent a 3-cycle, then $G$ is 4-choosable.

This page was built for publication: Some conditions on 5-cycles that make planar graphs 4-choosable

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6287913)