Abstract
A short cycle means a cycle of length at most 7. In this paper, we prove that planar graphs without adjacent short cycles are 3-colorable. This improves a result of Borodin et al. (2005).
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have