Search All of the Math Forum:

Views expressed in these public forums are not endorsed by NCTM or The Math Forum.

Topic: A New Graph Coloring Conjecture.
Replies: 42   Last Post: Jul 2, 2013 4:08 AM

 Search Thread: Advanced Search

 Messages: [ Previous | Next ]
 Tucsondrew@me.com Posts: 1,161 Registered: 5/24/13
Re: A New Graph Coloring Conjecture.
Posted: Jun 20, 2013 8:17 PM
 Plain Text Reply

On Thursday, June 20, 2013 4:48:02 PM UTC-7, bill wrote:
> On Wednesday, June 19, 2013 8:36:29 PM UTC-7, quasi wrote:
>

> > bill wrote:
>
> >
>
> >
>
> >
>
> > >Much simpler! Take a set of 4 MA vertices.
>
> >
>
> >
>
> >
>
> > What are MA vertices?
>
>
>
> mutually adjacent vertices
>

> >
>
> >
>
> >
>
> > >Then connect vertex 5 to each of the first four.
>
> >
>
> >
>
> >
>
> > No.
>
> > Any non-complete graph with 5 vertices is
>
> > 4-colorable.
>
> >
>
> What if the graph is non-planar?
>

Any non-complete graph with 5 vertices that is non-planar
requires 6 colors to color it. Or it 0?

ZG

>
> > quasi

Date Subject Author
6/18/13 b92057@yahoo.com
6/18/13 Tucsondrew@me.com
6/18/13 Tucsondrew@me.com
6/18/13 quasi
6/18/13 Tucsondrew@me.com
6/18/13 quasi
6/19/13 trj
6/20/13 b92057@yahoo.com
6/20/13 quasi
6/20/13 b92057@yahoo.com
6/22/13 b92057@yahoo.com
6/23/13 quasi
6/25/13 b92057@yahoo.com
6/25/13 quasi
6/25/13 b92057@yahoo.com
6/26/13 quasi
6/26/13 Brian Q. Hutchings
6/27/13 b92057@yahoo.com
6/27/13 quasi
6/27/13 b92057@yahoo.com
6/27/13 quasi
6/27/13 quasi
6/28/13 b92057@yahoo.com
6/28/13 quasi
6/28/13 b92057@yahoo.com
6/29/13 quasi
7/1/13 b92057@yahoo.com
7/2/13 quasi
6/19/13 b92057@yahoo.com
6/19/13 quasi
6/20/13 b92057@yahoo.com
6/20/13 Tucsondrew@me.com
6/21/13 quasi
6/21/13 quasi
6/22/13 b92057@yahoo.com
6/23/13 quasi
6/19/13 b92057@yahoo.com
6/20/13 quasi
6/20/13 quasi
6/20/13 Butch Malahide
6/20/13 Butch Malahide
6/19/13 b92057@yahoo.com
6/20/13 b92057@yahoo.com

© The Math Forum at NCTM 1994-2017. All Rights Reserved.