Get 20M+ Full-Text Papers For Less Than $1.50/day. Start a 14-Day Trial for You or Your Team.

Learn More →

A Guide to Graph ColouringBounds and Constructive Algorithms

A Guide to Graph Colouring: Bounds and Constructive Algorithms [Towards the end of the previous chapter we saw a variety of different types of graphs that are relatively straightforward to colour optimally, including complete graphs, bipartite graphs, cycle and wheel graphs, and grid graphs. With regard to the chromatic number, we also saw that it is easy to determine when χ = G = 1 (G is an empty graph), and when χ = G = 2 (G is bipartite). But can we go further than this?] http://www.deepdyve.com/assets/images/DeepDyve-Logo-lg.png

A Guide to Graph ColouringBounds and Constructive Algorithms

Download PDF
27 pages

Loading next page...
 
/lp/springer-journals/a-guide-to-graph-colouring-bounds-and-constructive-algorithms-rpiZ4UY41r
Publisher
Springer International Publishing
Copyright
© Springer International Publishing Switzerland 2016
ISBN
978-3-319-25728-0
Pages
27 –54
DOI
10.1007/978-3-319-25730-3_2
Publisher site
See Chapter on Publisher Site

Abstract

[Towards the end of the previous chapter we saw a variety of different types of graphs that are relatively straightforward to colour optimally, including complete graphs, bipartite graphs, cycle and wheel graphs, and grid graphs. With regard to the chromatic number, we also saw that it is easy to determine when χ = G = 1 (G is an empty graph), and when χ = G = 2 (G is bipartite). But can we go further than this?]

Published: Oct 27, 2015

Keywords: Greedy Algorithm; Random Graph; Chromatic Number; Graph Colouring; Interval Graph

There are no references for this article.