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
PDF Tools
Image Tools
Text Tools
OCR Tools
Symbol and Emoji Tools
On-screen Keyboard
Latex Math Equation to Image
Smart IPA Phonetic Keyboard
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
95
click to vote
TCS
2008
98
views
Theoretical Computer Science
»
more
TCS 2008
»
Complexity of unique list colorability
15 years 3 months ago
Download
www.cs.bme.hu
Dániel Marx
Real-time Traffic
TCS 2008
|
Theoretical Computer Science
|
claim paper
Related Content
»
Uniquely 2list colorable graphs
»
On the Complexity of Some Colorful Problems Parameterized by Treewidth
»
On the Complexity of Ordered Colorings
»
On the complexity of distributed graph coloring
»
Outcome signature genes in breast cancer is there a unique set
»
The Complexity of Bottleneck Labeled Graph Problems
»
Genes2Networks connecting lists of gene symbols using mammalian protein interactions datab...
»
Overview of BioCreAtIvE task 1B normalized gene lists
»
Weak graph colorings distributed algorithms and applications
more »
Post Info
More Details (n/a)
Added
15 Dec 2010
Updated
15 Dec 2010
Type
Journal
Year
2008
Where
TCS
Authors
Dániel Marx
Comments
(0)
Researcher Info
Theoretical Computer Science Study Group
Computer Vision