Has four color proof been proved without the help of computer?Where can I find the paper?

closed as not a real question by Robin Chapman, gowers, Daniel Moskovich, Pete L. Clark, Andrea Ferretti Oct 6 '10 at 8:55
It's difficult to tell what is being asked here. This question is ambiguous, vague, incomplete, overly broad, or rhetorical and cannot be reasonably answered in its current form. For help clarifying this question so that it can be reopened, visit the help center.If this question can be reworded to fit the rules in the help center, please edit the question.
No, but the proof has been formalized into computercheckable form, using the proofassistant Coq. As far as I know, the proof still relies on enumeration of cases and is therefore quite tedious. For a paper, see Gonthier, Georges (2008), "Formal ProofThe FourColor Theorem", Notices of the American Mathematical Society 55 (11): 1382–1393 


Just as background, definitely not an answer to your question: You are probably aware of the paper, "A new proof of the four colour theorem," by N. Robertson, D. P. Sanders, P. D. Seymour and R. Thomas, in Electron. Res. Announc. Amer. Math. Soc. 2 (1996), 1725 (electronic). It is still a computer proof, but simpler than Appel and Haken's: "Our unavoidable set has size 633 as opposed to the 1476 member set of Appel and Haken, and our discharging method uses only 32 discharging rules, instead of the 300+ of Appel and Haken." 


from review http://www.ams.org/mathscinetgetitem?mr=1403921 of a survey paper by Paul Seymour, we find...


