Coloring planar graphs with triangles far apart

Details Coloring planar graphs with triangles far apart Coloring planar graphs with triangles far apart

2009-11-04

arxiv.org/abs/0911.0885v1

Mathematics

Combinatorics

Scientific paper

We settle a problem of Havel by showing that there exists an absolute
constant d such that if G is a planar graph in which every two distinct
triangles are at distance at least d, then G is 3-colorable.

Affiliated with

Also associated with

No associations

Rating

Coloring planar graphs with triangles far apart 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 Coloring planar graphs with triangles far apart, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Coloring planar graphs with triangles far apart will most certainly appreciate the feedback.

Rate now

Comments { 0 }

Profile ID: LFWR-SCP-O-620827