Combinatorics and Graph Theory

    

Application of Clairmont's Coloring Algorithm to the Errera Graph

Authors: John Clairmont

In a recent article I described a new alternating chain algorithm for four coloring planar graphs.Someone suggested that I test the algorithm on the Errera graph. Kempe Chains fail to four color the Errera graph but my algorithm had no problem four coloring the Errera graph.

Comments: 176 Pages.

Download: PDF

Submission history

[v1] 2025-04-12 22:10:55

Unique-IP document downloads: 200 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