Sciweavers
Explore
Publications
Books
Software
Tutorials
Presentations
Lectures Notes
Datasets
Labs
Conferences
Community
Upcoming
Conferences
Top Ranked Papers
Most Viewed Conferences
Conferences by Acronym
Conferences by Subject
Conferences by Year
Tools
Sci2ools
International Keyboard
Graphical Social Symbols
CSS3 Style Generator
OCR
Web Page to Image
Web Page to PDF
Merge PDF
Split PDF
Latex Equation Editor
Extract Images from PDF
Convert JPEG to PS
Convert Latex to Word
Convert Word to PDF
Image Converter
PDF Converter
Community
Sciweavers
About
Terms of Use
Privacy Policy
Cookies
Free Online Productivity Tools
i2Speak
i2Symbol
i2OCR
iTex2Img
iWeb2Print
iWeb2Shot
i2Type
iPdf2Split
iPdf2Merge
i2Bopomofo
i2Arabic
i2Style
i2Image
i2PDF
iLatex2Rtf
Sci2ools
35
click to vote
JCT
2008
favorite
Email
discuss
report
96
views
more
JCT 2008
»
Graphs with full rank 3-color matrix and few 3-colorings
13 years 10 months ago
Download
www.math.princeton.edu
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 superpolynomial in the number of vertices.
Serguei Norine, Jean-Sébastien Sereni
Real-time Traffic
Column Rank
|
Conjecture
|
Distinct 3-colorings
|
JCT 2008
|
claim paper
Related Content
»
New Tools for Graph Coloring
more »
Post Info
More Details (n/a)
Added
13 Dec 2010
Updated
13 Dec 2010
Type
Journal
Year
2008
Where
JCT
Authors
Serguei Norine, Jean-Sébastien Sereni
Comments
(0)
Researcher Info
JCT 2008 Study Group
Computer Vision