Sciweavers

APPROX
2011
Springer
242views Algorithms» more  APPROX 2011»
12 years 3 months ago
New Tools for Graph Coloring
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...
Sanjeev Arora, Rong Ge
DAM
2002
78views more  DAM 2002»
13 years 3 months ago
Uniquely 2-list colorable graphs
A graph is said to be uniquely list colorable, if it admits a list assignment which induces a unique list coloring. We study uniquely list colorable graphs with a restriction on t...
Yashar Ganjali, Mohammad Ghebleh, Hossein Hajiabol...