Chromatic graph theory / Gary Chartrand and Ping Zhang
Material type:
TextPublication details: Boca Raton : CRC Press, 2009Description: xiii, 483 p. 24 cmISBN: - 9781584888000
- 511.56 CHA
| Item type | Current library | Call number | Status | Date due | Barcode | Item holds | |
|---|---|---|---|---|---|---|---|
Book
|
Calcutta | 511.56 CHA (Browse shelf(Opens below)) | Available | IIMC-127990 |
Browsing Calcutta shelves Close shelf browser (Hides shelf browser)
|
|
|
|
|
|
|
||
| 511.5024004 ALA Graph theory with applications to algorithms and computer science / | 511.502855 KNU The Stanford graph base : | 511.52 WUB Spanning trees and optimization problems / | 511.56 CHA Chromatic graph theory / | 511.56 WER Graph colouring and variations / | 511.56 WIL Four colors suffice : | 511.6 AUS Analysis and Design of algorithms for combinatorial problems / |
This self-contained book first presents various fundamentals of graph theory that lie outside of graph colorings, including basic terminology and results, trees and connectivity, Eulerian and Hamiltonian graphs, matchings and factorizations, and graph embeddings. The remainder of the text deals exclusively with graph colorings. It covers vertex colorings and bounds for the chromatic number, vertex colorings of graphs embedded on surfaces, and a variety of restricted vertex colorings. The authors also describe edge colorings, monochromatic and rainbow edge colorings, complete vertex colorings, several distinguishing vertex and edge colorings, and many distance-related vertex colorings.
There are no comments on this title.