Re: New proof of Four Color Theorem


bill wrote:
> It seems to me that the maximun vertex degree in almost all
> "regularized" graphs will never be greater than 3? Anand's method
> could be used to prove that a K_5 complete graph is 4-colorable!

No, that it's 6 colorable (5 + 1, not 5 - 1).

--- Christopher Heckman

.

Relevant Pages

  • Re: Need Graph Isomorphism Algorithm De-bunked
    ... Bill Cox algorithm that you verified up to 8 nodes, ... not in your implementation) is in my rendering of Bill Cox's ... proved the graphs are not isomorphic. ... graphs are equal iff you have established an isomorphism between the two graphs, and to do that you have to cope with Bill Cox's automorphism issue. ...
    (sci.crypt)
  • Re: Silly Question 101
    ... > useful to look at graphs etc. ... Bill ... Garden Shade Zone 5 in a Japanese Jungle manner. ...
    (sci.med.cardiology)
  • Re: Doubt - Proof of Four Color Theorem
    ... Robert J. Kolker wrote: ... > bill wrote: ... graphs have exactly one planar embedding; this is a theorem of Whitney ...
    (sci.math)
  • Re: Suns activity rules out link to global warming
    ... with temperature increase. ... Even the diehard warmers will tell you that there is lag between warming ... Bill, I don't have to change anything. ... Those are not my graphs. ...
    (sci.geo.geology)
  • to stop zero from showing on graph
    ... I have graphs for which values will be filled in time, but befor it's filled ... I want zeroes not to be visible. ... Prev by Date: ...
    (microsoft.public.excel.charting)