Re: half page proof of 4 Color Mapping Theorem; using Moebius 4 adjacency maximum
- From: Larry Hammick <larryhammick@xxxxxxxxx>
- Date: Tue, 07 Feb 2006 23:57:41 EST
From personal experience I can tell you that the 4 color problem is as slippery as an eel in a pail of snot..
- Follow-Ups:
- Prev by Date: Thanks matt271829-news@yahoo.co.uk
- Next by Date: Re: Proving that [inv(A)](k,k) >= 1/[A(k,k)]
- Previous by thread: pivot = leading entry
- Next by thread: Re: half page proof of 4 Color Mapping Theorem; using Moebius 4 adjacency maximum
- Index(es):
