Total Colourings of Graphs
β Scribed by Yap H. P.
- Book ID
- 127405072
- Year
- 1996
- Tongue
- English
- Weight
- 492 KB
- Category
- Library
No coin nor oath required. For personal study only.
β¦ Synopsis
This book provides an up-to-date and rapid introduction to an important and currently active topic in graph theory. The author leads the reader to the forefront of research in this area. Complete and easily readable proofs of all the main theorems, together with numerous examples, exercises and open problems are given. The book is suitable for use as a textbook or as seminar material for advanced undergraduate and graduate students. The references are comprehensive and so it will also be useful for researchers as a handbook.
π SIMILAR VOLUMES
This book provides an up-to-date and rapid introduction to an important and currently active topic in graph theory. The author leads the reader to the forefront of research in this area. Complete and easily readable proofs of all the main theorems, together with numerous examples, exercises and open
It is proved that if G is a planar graph with total (vertex-edge) chromatic number Ο , maximum degree and girth g, then Ο = + 1 if β₯ 5 and g β₯ 5, or β₯ 4 and g β₯ 6, or β₯ 3 and g β₯ 10. These results hold also for graphs in the projective plane, torus and Klein bottle.
We give a new upper bound on the total chromatic number of a graph. This bound improves the results known for some classes of graphs. The bound is stated as follows: ZT ~< Z~ + L l3 ~ J + 2, where Z is the chromatic number, Z~ is the edge chromatic number (chromatic index) and ZT is the total chroma