2 search results - page 1 / 1 » Graphs with full rank 3-color matrix and few 3-colorings |
JCT
2008
13 years 4 months ago
2008
We exhibit a a counterexample to a conjecture of Thomassen stating that the number of distinct 3-colorings of every graph whose 3color matrix has full column rank is superpolynomi...
APPROX
2011
Springer
12 years 4 months ago
2011
Springer
How to color 3 colorable graphs with few colors is a problem of longstanding interest. The best polynomial-time algorithm uses n0.2072 colors. There are no indications that colori...