New answers tagged polynomial-time
0
votes
Seeking Help to Verify Algorithm for Chromatic Number in Polynomial Time
Experimentally, all i have for you is:
The Strong Color Theorem:
Most random regular graphs with degree d*d or less are d+1 colorable.
checkable is c4d9n200.
uncheckable is c5d16n80.
needs more ...
Top 50 recent answers are included