Excluding 4-wheels

Details Excluding 4-wheels Excluding 4-wheels

2012-02-16

arxiv.org/abs/1202.3549v2

Computer Science

Discrete Mathematics

Scientific paper

A 4-wheel is a graph formed by a cycle C and a vertex not in C that has at
least four neighbors in C. We prove that a graph G that does not contain a
4-wheel as a subgraph is 4-colorable and we describe some structural properties
of such a graph.

Affiliated with

Also associated with

No associations

Rating

Excluding 4-wheels 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 Excluding 4-wheels, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Excluding 4-wheels will most certainly appreciate the feedback.

Rate now

Comments { 0 }

Profile ID: LFWR-SCP-O-125276