A note on 3-colorable plane graphs without 5- and 7-cycles
| dc.creator | Xu, Baogang | |
| dc.date | 2008-10-08 | |
| dc.date.accessioned | 2026-07-07T10:08:32Z | |
| dc.date.available | 2026-07-07T10:08:32Z | |
| dc.description | 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). | |
| dc.description | 6 pages | |
| dc.identifier | https://arxiv.org/abs/0810.1437 | |
| dc.identifier | http://arxiv.org/abs/0810.1437 | |
| dc.identifier.uri | http://salesiana.dossiersoluciones.com/handle/123456789/171027 | |
| dc.subject | Combinatorics | |
| dc.title | A note on 3-colorable plane graphs without 5- and 7-cycles | |
| dc.type | text |