Planar Graph Theory and the Four Color Problem (V)——The Channel of Proof of the Four Color Theorem Assisted by Computer
Received:August 20, 1984  
Key Words:   
Fund Project:
Author NameAffiliation
Liu Yanpei Institute of Applied Mathematics
Academia Sinice 
Hits: 2312
Download times: 805
Abstract:
      This is the fifth part of the series of five papers about planar graph theory and the four color problem.It contains the following five sections . §21Reducibility; § 22 Unavoidable sets of configurations; § 23Discharging; § 24Testing reducibility by computer; § 25The probability analysis.
Citation:
DOI:10.3770/j.issn:1000-341X.1986.02.045
View Full Text  View/Add Comment