Total Colourings - A survey

12/14/2018
by   Geetha Jayabalan, et al.
0

The smallest integer k needed for the assignment of colors to the elements so that the coloring is proper (vertices and edges) is called the total chromatic number of a graph. Vizing and Behzed conjectured that the total coloring can be done using at most Δ(G)+2 colors, where Δ(G) is the maximum degree of G. It is not settled even for planar graphs. In this paper we give a survey on total coloring of graphs.

READ FULL TEXT

page 1

page 2

page 3

page 4

research
04/26/2019

Every planar graph with Δ≥ 8 is totally (Δ+2)-choosable

Total coloring is a variant of edge coloring where both vertices and edg...
research
10/27/2021

Most direct product of graphs are Type 1

A k-total coloring of a graph G is an assignment of k colors to its elem...
research
05/27/2023

On Locally Identifying Coloring of Cartesian Product and Tensor Product of Graphs

For a positive integer k, a proper k-coloring of a graph G is a mapping ...
research
05/20/2021

Total Coloring and Total Matching: Polyhedra and Facets

A total coloring of a graph G = (V, E) is an assignment of colors to ver...
research
07/29/2019

A Connected Version of the Graph Coloring Game

The graph coloring game is a two-player game in which, given a graph G a...
research
03/10/2023

New Results on Edge-coloring and Total-coloring of Split Graphs

A split graph is a graph whose vertex set can be partitioned into a cliq...
research
06/24/2019

Hierarchical Colorings of Cographs

Cographs are exactly hereditarily well-colored graphs, i.e., the graphs ...

Please sign up or login with your details

Forgot password? Click here to reset