MetaCart Sign in to MyCiteSeerX

Documents
Authors
Tables !

Searching for "Almost All k-Colorable Graphs are Easy to Color." – sorted by Relevance.

Order by: Citations | Year (Descending) | Year (Ascending) | Recency

Try your query at: Scholar | Yahoo! | Ask | Bing | CSB

3 documents found, showing 1 through 3.

ATOM

Almost All k-Colorable Graphs Are Easy to Color
by Jonathan S. Turner
…Almost all k-Colorable Graphs are Easy to Color Jonathan S. Turner* Computer Science Department…
Cited by 53 (0 self) – Add To MetaCart

Joe Culberson's Graph Colouring Bibliography
by Joe Culberson, Robin J. Wilson, Graph Colourings, Haim Hanani, Norbert Sauer, Johanan Schonheim, English Summary — 1978
… all k-colorable graphs are easy to color. Journal of Algorithms, 9:63--82, 1988. [390] Zsolt Tuza…
Add To MetaCart

Hidden Solutions, Tell-tales, Heuristics and Anti-heuristics
by Joseph Culberson Dept, Joseph Culberson — 2001 — IJCAI01 Workshop on Empirical Methods in Artificial Intelligence
… [Turner, 1988] to show that for fixed k, almost all k- colorable graphs are easy to color…
Add To MetaCart

Showing 1 through 3.

ATOM

Try your query at: Scholar | Yahoo! | Ask | Bing | CSB