A note on 3-colorable plane graphs without 5- and 7-cycles
Combinatorics
2008-10-09 v1
Abstract
Borodin et al figured out a gap of the paper published at J. Combinatorial Theory Ser. B (Vol.96 (2006) 958--963), and gave a new proof with the similar technique. The purpose of this note is to fix the gap by slightly revising the definition of special faces, and adding a few lines of explanation in the proofs (new added text are all in black font).
Keywords
Cite
@article{arxiv.0810.1437,
title = {A note on 3-colorable plane graphs without 5- and 7-cycles},
author = {Baogang Xu},
journal= {arXiv preprint arXiv:0810.1437},
year = {2008}
}
Comments
6 pages