DocumentCode
3476175
Title
Notice of Retraction
The four-color conjecture
Author
Zhou Haiyan ; Bai Xiaolin ; Qi Hui
Author_Institution
Fac. of Comput. Eng., Huaiyin Inst. of Technol., Huaiyin, China
Volume
3
fYear
2010
fDate
12-13 June 2010
Firstpage
224
Lastpage
227
Abstract
Notice of Retraction
After careful and considered review of the content of this paper by a duly constituted expert committee, this paper has been found to be in violation of IEEE´s Publication Principles.
We hereby retract the content of this paper. Reasonable effort should be made to remove all past references to this paper.
The presenting author of this paper has the option to appeal this decision by contacting TPII@ieee.org.
The four-colors problem was formally brought up more than one hundred years ago. K. Apel and W. Haken of Illinois University had proved the question with computer. This proof made widely controversy, however the problem of “non-computer” proof is still suspend. This paper informed a sufficient condition of 4_chromatic planar graph and proved that one of the planar graph G and the Dual of graph G ´is 4_chromati graph at least.
After careful and considered review of the content of this paper by a duly constituted expert committee, this paper has been found to be in violation of IEEE´s Publication Principles.
We hereby retract the content of this paper. Reasonable effort should be made to remove all past references to this paper.
The presenting author of this paper has the option to appeal this decision by contacting TPII@ieee.org.
The four-colors problem was formally brought up more than one hundred years ago. K. Apel and W. Haken of Illinois University had proved the question with computer. This proof made widely controversy, however the problem of “non-computer” proof is still suspend. This paper informed a sufficient condition of 4_chromatic planar graph and proved that one of the planar graph G and the Dual of graph G ´is 4_chromati graph at least.
Keywords
graph colouring; 4-chromatic planar graph; four-colors problem; noncomputer proof problem; Color; Dual of graph; K-chromatic; Planar graph;
fLanguage
English
Publisher
ieee
Conference_Titel
Computer and Communication Technologies in Agriculture Engineering (CCTAE), 2010 International Conference On
Conference_Location
Chengdu
Print_ISBN
978-1-4244-6944-4
Type
conf
DOI
10.1109/CCTAE.2010.5544243
Filename
5544243
Link To Document