combinatorics / Topological graph theory
A cyclic coloration of a triangulation of a closed 2-manifold gives the faces around every vertex distinct colors. Chen and Lawrencenko made two conjectures about the cyclic chromatic number of minimal triangulations in 1999. Their second is proved here and their first disproved.
Temporal state
No reconciled state yet.
Append-only history
One conjecture each way: the second proved, the first disproved. Two further Chen-Lawrencenko conjectures remain open and are flagged as such in the paper.
Research memory
A cyclic coloration of a triangulation of a closed 2-manifold gives the faces around every vertex distinct colors. Chen and Lawrencenko made two conjectures about the cyclic chromatic number of minimal triangulations in 1999. Their second is proved here and their first disproved.
One conjecture each way: the second proved, the first disproved. Two further Chen-Lawrencenko conjectures remain open and are flagged as such in the paper.
Evidence graph
No public relationships recorded yet.