A note on 3-colorable plane graphs without 5- and 7-cycles

Details A note on 3-colorable plane graphs without 5- and 7-cycles A note on 3-colorable plane graphs without 5- and 7-cycles

2008-10-08

arxiv.org/abs/0810.1437v1

Mathematics

Combinatorics

6 pages

Scientific paper

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).

Affiliated with

Also associated with

No associations

Rating

A note on 3-colorable plane graphs without 5- and 7-cycles does not yet have a rating. At this time, there are no reviews or comments for this scientific paper.

If you have personal experience with A note on 3-colorable plane graphs without 5- and 7-cycles, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and A note on 3-colorable plane graphs without 5- and 7-cycles will most certainly appreciate the feedback.

Rate now

Comments { 0 }

Profile ID: LFWR-SCP-O-30192