Open AccessPlanar graphs without 4-,5- and 8-cycles are 3-colorable
Author(s) -
Sakib A. Mondal
Publication year - 2011
Publication title -
discussiones mathematicae graph theory
Language(s) - English
Resource type - Journals
SCImago Journal Rank - 0.476
H-Index - 19
eISSN - 2083-5892
pISSN - 1234-3099
DOI - 10.7151/dmgt.1579
Subject(s) - mathematics , combinatorics , planar graph , planar , outerplanar graph , discrete mathematics , graph , pathwidth , computer science , computer graphics (images) , line graph
In this paper we prove that every planar graph without 4, 5 and 8-cycles is 3-colorable.
Accelerating Research
Robert Robinson Avenue,
Oxford Science Park, Oxford
OX4 4GP, United Kingdom
Address
John Eccles HouseRobert Robinson Avenue,
Oxford Science Park, Oxford
OX4 4GP, United Kingdom