Excluding 4-wheels

Computer Science – Discrete Mathematics

Scientific paper

Rate now

  [ 0.00 ] – not rated yet Voters 0   Comments 0

Details

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.

No associations

LandOfFree

Say what you really think

Search LandOfFree.com for scientists and scientific papers. Rate them and share your experience with other people.

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

     

Profile ID: LFWR-SCP-O-125276

  Search
All data on this website is collected from public sources. Our data reflects the most accurate information available at the time of publication.