1 problem

0 votes0 replies0 views
Conjecture on the maximal insertion model withstandable by the coloring algorithm
Insertion-model conjecture. The most general insertion model that the algorithm can withstand is one in which the original color classes are respected.
Conjectureopengraph-coloring robustness tensor-graphsarXiv posted 2 days ago

Conjecture on the maximal insertion model withstandable by the coloring algorithm