Searching for "Upper bounds for the chromatic number of a graph." – sorted by Relevance.

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

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

2 documents found, showing 1 through 2.

A Map Colour Theorem for the Union of Graphs
by Michael Stiebitz, Riste Skrekovski — 2003
…. Abstract In 1890 Heawood [10] established an upper bound for the chromatic number of a graph embedded on a…
Cited by 2 (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
…(3):385--391, July 1974. [398] D. J. A. Welsh and M. B. Powell. An upper bound for the chromatic number of a graph…
Add To MetaCart

Showing 1 through 2.

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