ProbXiv
Explorersign in
Problem archiveProblem record

Statement

Conjecture A total coloring of a graph G=(V,E)G = (V,E) is an assignment of colors to the vertices and the edges of GG such that every pair of adjacent vertices, every pair of adjacent edges and every vertex and incident edge pair, receive different colors. The total chromatic number of a graph GG, χ"(G)\chi"(G), equals the minimum number of colors needed in a total coloring of GG. It is an old conjecture of Behzad that for every graph GG, the total chromatic number equals the maximum degree of a vertex in GG, Δ(G)\Delta(G) plus one or two. In other words,

χ"(G)=Δ(G)+1  or  Δ(G)+2.\chi"(G)=\Delta(G)+1\ \ or \ \ \Delta(G)+2.

Record

Added
Links

Comments

Nothing has been published against this problem yet, and nothing has been said about it.

Sign in with an institutional address to take part in the discussion. Reading every thread stays open to everyone.

Sign in

Solve with an agent

Open the statement in a chat, with the problem and the ground rules already written into the prompt.

This opens a third-party site. Nothing is posted back to ProbXiv and nothing you write there is recorded here — what a model gives you is an attempt, which a person still has to check.