AbstractThe total chromatic number χT(G) of a graph G is the minimum number of colours needed to colour the edges and the vertices of G so that incident or adjacent elements have distinct colours. We show that if G is a regular graph of even order and δ(G)⩾23|V(G)|+236, thenχT(G)⩽Δ(G)+2
AbstractThe total chromatic number of a graph G, χT(G), is the least number of colours sufficient to...
AbstractThe total chromatic number χt(G) of a graph G is the least number of colors needed to color ...
AbstractWe give a survey of various recent results concerning the total chromatic number of simple g...
AbstractFor a given graph G, denote by GΔ the subgraph of G induced by the vertices of maximum degre...
AbstractWe give a new upper bound on the total chromatic number of a graph. This bound improves the ...
AbstractThe total chromatic number χT(G) of a graph G is the least number of colours needed to colou...
AbstractThe total chromatic number χT(G) of a graph G is the least number of colours needed to colou...
A total coloring of a graph is a proper coloring in which no two adjacent or incident graph elements...
AbstractThe total chromatic number XT(G) of a graph G is the least number of colours needed to colou...
AbstractIn this paper, the total chromatic number and the fractional total chromatic number of circu...
AbstractThe total chromatic number χT(G) of a graph G is the minimum number of colours needed to col...
AbstractWe show that a regular graph G of order at least 6 whose complement Ḡ is bipartite has total...
AbstractThe total chromatic number ξT(G) of a graph G is the least number of colours needed to colou...
AbstractIt is proved that ifGis a planar graph with total (vertex–edge) chromatic number χ″, maximum...
AbstractGiven a graph G = (V, E) having maximum degree δ with a proper vertex-colouring ϕ : V → {1,2...
AbstractThe total chromatic number of a graph G, χT(G), is the least number of colours sufficient to...
AbstractThe total chromatic number χt(G) of a graph G is the least number of colors needed to color ...
AbstractWe give a survey of various recent results concerning the total chromatic number of simple g...
AbstractFor a given graph G, denote by GΔ the subgraph of G induced by the vertices of maximum degre...
AbstractWe give a new upper bound on the total chromatic number of a graph. This bound improves the ...
AbstractThe total chromatic number χT(G) of a graph G is the least number of colours needed to colou...
AbstractThe total chromatic number χT(G) of a graph G is the least number of colours needed to colou...
A total coloring of a graph is a proper coloring in which no two adjacent or incident graph elements...
AbstractThe total chromatic number XT(G) of a graph G is the least number of colours needed to colou...
AbstractIn this paper, the total chromatic number and the fractional total chromatic number of circu...
AbstractThe total chromatic number χT(G) of a graph G is the minimum number of colours needed to col...
AbstractWe show that a regular graph G of order at least 6 whose complement Ḡ is bipartite has total...
AbstractThe total chromatic number ξT(G) of a graph G is the least number of colours needed to colou...
AbstractIt is proved that ifGis a planar graph with total (vertex–edge) chromatic number χ″, maximum...
AbstractGiven a graph G = (V, E) having maximum degree δ with a proper vertex-colouring ϕ : V → {1,2...
AbstractThe total chromatic number of a graph G, χT(G), is the least number of colours sufficient to...
AbstractThe total chromatic number χt(G) of a graph G is the least number of colors needed to color ...
AbstractWe give a survey of various recent results concerning the total chromatic number of simple g...
DOI
Add to ORKG