Abstract
In this paper we prove that every planar graph without 4, 5 and 8-cycles is 3-colorable.
Author supplied keywords
Cite
CITATION STYLE
APA
Mondal, S. A. (2011). Planar graphs without 4-, 5- and 8-cycles are 3-colorable. Discussiones Mathematicae - Graph Theory, 31(4), 775–789. https://doi.org/10.7151/dmgt.1579
Register to see more suggestions
Mendeley helps you to discover research relevant for your work.
Already have an account? Sign in
Sign up for free