Combinatorics and Graph Theory

    

An Elementary Solution of the Four-color Conjecture

Authors: Chongxi Yu

The four-color conjecture ( Guthrie's problem after F. Guthrie) is divided into 5 simple groups, every region is shared a common boundary with 1, 2, 3, 4, and unlimited regions sharing a common boundary (other than a single point) do not share the same color to make the problem much simpler and clearer, The four-color theorem is solved perfectly by using these simpler models.

Comments: 3 Pages.

Download: PDF

Submission history

[v1] 2023-05-06 01:46:21

Unique-IP document downloads: 289 times

Vixra.org is a pre-print repository rather than a journal. Articles hosted may not yet have been verified by peer-review and should be treated as preliminary. In particular, anything that appears to include financial or legal advice or proposed medical treatments should be treated with due caution. Vixra.org will not be responsible for any consequences of actions that result from any form of use of any documents on this website.

Add your own feedback and questions here:
You are equally welcome to be positive or negative about any paper but please be polite. If you are being critical you must mention at least one specific error, otherwise your comment will be deleted as unhelpful.

comments powered by Disqus