Prove Four-Color Conjecture With "Color Chain Combination Theory"

In the second issue of xinzhou teachers university Journal in 2004, The Perfection of Kempe's Proof was published [1]. The key points are: using the different combination theory of six color chains and the periodic H-staining program, nine configurations were constructed, which answered the question of how many Heawood configurations Kempe missed, but the discussion was not complete and accurate. In this paper, not only the generation process and detailed solution process of nine configurations are given completely, but also the completeness of nine configurations is proved by reduction to absurdity, which is an important revision and supplement of literature 1. It is different from the published method of "4- staining of dilemma configuration of four-color conjecture", but the classification of the configuration is completely consistent with the conclusion of 4- staining which can be used as a companion for readers to taste.

Authors

Publication Details

Journal
Japan Journal of Research
Published
2024-08-30
DOI
https://doi.org/10.33425/2690-8077.1129
Primary Topic
Graph Labeling and Dimension Problems
Type
article
Field-Weighted Citation Impact
0.00

Funders

Controls
|||
ALL TIME
JAN
FEB
MAR
APR
MAY
JUN
JUL
AUG
SEP
OCT
article

Prove Four-Color Conjecture With "Color Chain Combination Theory"

Yudian Zhang, Yiran Zhang, Gong Yixuan
Japan Journal of Research
Graph Labeling and Dimension Problems
article

Prove Four-Color Conjecture With "Color Chain Combination Theory"

Yudian Zhang, Yiran Zhang, Gong Yixuan
article en

Abstract

In the second issue of xinzhou teachers university Journal in 2004, The Perfection of Kempe's Proof was published [1]. The key points are: using the different combination theory of six color chains and the periodic H-staining program, nine configurations were constructed, which answered the question of how many Heawood configurations Kempe missed, but the discussion was not complete and accurate. In this paper, not only the generation process and detailed solution process of nine configurations are given completely, but also the completeness of nine configurations is proved by reduction to absurdity, which is an important revision and supplement of literature 1. It is different from the published method of "4- staining of dilemma configuration of four-color conjecture", but the classification of the configuration is completely consistent with the conclusion of 4- staining which can be used as a companion for readers to taste.

Japan Journal of ResearchVol. 5(7)
Shandong University, Shanghai Normal University, Tsinghua University
Openalex Percentile: Top 82%
Graph Labeling and Dimension Problems
AI Navigator

Ask Laika to Summarize, Analyze, and Connect papers live on the map.

Summarize Papers & Methodologies

Extract key findings, datasets, and comparative methods across publications.

Benchmark Rankings & Visual Analytics

Rank top research institutions, authors, funders, topics, and journals by Field-Weighted Citation Impact (FWCI) and paper volume with instant charts.

Connect Distant Disciplines

Bridge topological clusters on the map to find hidden collaborative intersections.

Prove Four-Color Conjecture With "Color Chain Combination Theory" — Yudian Zhang, Yiran Zhang, et al. · Japan Journal of Research (2024) | TGRS Research Map | TGRS