Title of article
Graphs with full rank 3-color matrix and few 3-colorings
Author/Authors
Norine، نويسنده , , Serguei and Sereni، نويسنده , , Jean-Sébastien، نويسنده ,
Issue Information
روزنامه با شماره پیاپی سال 2008
Pages
2
From page
1115
To page
1116
Abstract
We exhibit a counterexample to a conjecture of Thomassen stating that the number of distinct 3-colorings of every graph whose 3-color matrix has full column rank is superpolynomial in the number of vertices.
Keywords
graph , Vertex coloring , vector space
Journal title
Journal of Combinatorial Theory Series B
Serial Year
2008
Journal title
Journal of Combinatorial Theory Series B
Record number
1528752
Link To Document