Most direct product of graphs are Type 1

10/27/2021
by   Diane Castonguay, et al.
0

A k-total coloring of a graph G is an assignment of k colors to its elements (vertices and edges) so that adjacent or incident elements have different colors. The total chromatic number is the smallest integer k for which the graph G has a k-total coloring. Clearly, this number is at least Δ(G)+1, where Δ(G) is the maximum degree of G. When the lower bound is reached, the graph is said to be Type 1. The upper bound of Δ(G)+2 is a central problem that has been open for fifty years, is verified for graphs with maximum degree 4 but not for regular graphs. Most classified direct product of graphs are Type 1. The particular cases of the direct product of cycle graphs C_m × C_n, for m =3p, 5ℓ and 8ℓ with p ≥ 2 and ℓ≥ 1, and arbitrary n ≥ 3, were previously known to be Type 1 and motivated the conjecture that, except for C_4 × C_4, all direct product of cycle graphs C_m × C_n with m,n ≥ 3 are Type 1. We give a general pattern proving that all C_m × C_n are Type 1, except for C_4 × C_4. dditionally, we investigate sufficient conditions to ensure that the direct product reaches the lower bound for the total chromatic number.

READ FULL TEXT

page 1

page 2

page 3

page 4

research
12/14/2018

Total Colourings - A survey

The smallest integer k needed for the assignment of colors to the elemen...
research
06/13/2020

Total Coloring for some classes of Circulant graphs

The Total coloring conjecture states that any simple graph G with maximu...
research
06/13/2020

Total Coloring for some classes of Cayley graphs

The Total coloring conjecture states that any simple graph G with maximu...
research
12/24/2019

A Brooks-like result for graph powers

Coloring a graph G consists in finding an assignment of colors c: V(G)→{...
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
03/21/2020

A proof of the Total Coloring Conjecture

A total coloring of a graph G is a map f:V(G) ∪ E(G) →𝒦, where 𝒦 is a se...
research
06/07/2020

Two lower bounds for p-centered colorings

Given a graph G and an integer p, a coloring f : V(G) →ℕ is p-centered i...

Please sign up or login with your details

Forgot password? Click here to reset