Total Colourings of Graphs

✍ Yap H. P. 📂 Library 📅 1996 🌐 English ⚖ 492 KB

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

✍ Hian-Poh Yap (auth.) 📂 Library 📅 1996 🏛 Springer 🌐 English ⚖ 830 KB

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

Fractional total colourings of graphs of

Fractional total colourings of graphs of high girth

✍ Tomáš Kaiser; Andrew King; Daniel Králʼ 📂 Article 📅 2011 🏛 Elsevier Science 🌐 English ⚖ 273 KB

Total Colourings of Planar Graphs with L

Total Colourings of Planar Graphs with Large Girth

✍ O.V. Borodin; A.V. Kostochka; D.R. Woodall 📂 Article 📅 1998 🏛 Elsevier Science 🌐 English ⚖ 96 KB

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.

A new upper bound for total colourings o

A new upper bound for total colourings of graphs

✍ Abdón Sánchez-Arroyo 📂 Article 📅 1995 🏛 Elsevier Science 🌐 English ⚖ 118 KB

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

Fractionally colouring total graphs

✍ K. Kilakos; B. Reed 📂 Article 📅 1993 🏛 Springer-Verlag 🌐 English ⚖ 312 KB