Article ID Journal Published Year Pages File Type
4646783 Discrete Mathematics 2016 6 Pages PDF
Abstract

Lam et al. proved that every planar graph without 4-cycles is 4-choosable (Lam et al., 1999). In this paper, we improve this result by showing that every planar graph without 4-cycles adjacent to triangles is 4-choosable.

Keywords
Related Topics
Physical Sciences and Engineering Mathematics Discrete Mathematics and Combinatorics
Preview
Planar graphs without 4-cycles adjacent to triangles are 4-choosable
Authors
, , ,