AbstractWe 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: χT ⩽ χe + ⌊13χ⌋ + 2, where χ is the chromatic number, χe is the edge chromatic number (chromatic index) and χT is the total chromatic number
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 least number of colours needed to colou...
AbstractThe result announced in the title is proved. A new proof of the total 6-colorability of any ...
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...
AbstractWe give a survey of various recent results concerning the total chromatic number of simple g...
AbstractThis paper gives a number of recent results concerning total colourings and suggests that re...
AbstractGiven a graph G = (V, E) having maximum degree δ with a proper vertex-colouring ϕ : V → {1,2...
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...
AbstractThis paper introduces three new upper bounds on the chromatic number, without making any ass...
AbstractThe total-chromatic number χT(G) is the least number of colours needed to colour the vertice...
AbstractThe total chromatic number χT(G) of a graph G is the minimum number of colours needed to col...
We give a new upper bound on the total chromatic number of a graph. This bound improves the results ...
AbstractThe total chromatic number of a graph G, χT(G), is the least number of colours sufficient to...
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 least number of colours needed to colou...
AbstractThe result announced in the title is proved. A new proof of the total 6-colorability of any ...
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...
AbstractWe give a survey of various recent results concerning the total chromatic number of simple g...
AbstractThis paper gives a number of recent results concerning total colourings and suggests that re...
AbstractGiven a graph G = (V, E) having maximum degree δ with a proper vertex-colouring ϕ : V → {1,2...
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...
AbstractThis paper introduces three new upper bounds on the chromatic number, without making any ass...
AbstractThe total-chromatic number χT(G) is the least number of colours needed to colour the vertice...
AbstractThe total chromatic number χT(G) of a graph G is the minimum number of colours needed to col...
We give a new upper bound on the total chromatic number of a graph. This bound improves the results ...
AbstractThe total chromatic number of a graph G, χT(G), is the least number of colours sufficient to...
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 least number of colours needed to colou...
AbstractThe result announced in the title is proved. A new proof of the total 6-colorability of any ...
DOI
Add to ORKG