A comment to: On 3-colorable planar graphs without short cycles

Details A comment to: On 3-colorable planar graphs without short cycles A comment to: On 3-colorable planar graphs without short cycles

2008-10-20

arxiv.org/abs/0810.3298v1

Mathematics

Combinatorics

2 pages

Scientific paper

Let G be a graph. It was proved that if G is a planar graph without {4, 6,
7}-cycles and without two 5-cycles sharing exactly one edge, then G
3-colorable. We observed that the proof of this result is not correct.

Affiliated with

Also associated with

No associations

Rating

A comment to: On 3-colorable planar graphs without short 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 comment to: On 3-colorable planar graphs without short cycles, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and A comment to: On 3-colorable planar graphs without short cycles will most certainly appreciate the feedback.

Rate now

Comments { 0 }

Profile ID: LFWR-SCP-O-264916