AbstractThe total chromatic number of an arbitrary graph is the smallest number of colours needed to colour the edges and vertices of the graph so that no two adjacent or incident elements of the graph receive the same colour. In this paper we prove that the problem of determining the total chromatic number of a k-regular bipartite graph is NP-hard, for each fixed k⩾3
A b-coloring of a graph is a proper coloring such that every color class contains a vertex that is a...
AbstractIt is well known that the problem of graph k-colourability, for any k≥3, is NP-complete but ...
A Grundy k-coloring of a graph G, is a vertex k-coloring of G such that for each two colors i and j ...
In this paper it is proved that the problem of determining the total chromatic number of an arbitrar...
AbstractThe total chromatic number χT(G) of a graph G is the least number of colours needed to colou...
Let G be a simple graph. An IE-total coloring f of G is a coloring of the vertices and edges of G so...
AbstractWe show that a regular graph G of order at least 6 whose complement Ḡ is bipartite has total...
A graph is $k$-total colourable if there is an assignment of $k$ different colours to the vertices a...
AbstractThe total chromatic number χT(G) of a graph G is the minimum number of colours needed to col...
The colouring number of a graph G, defined as col(G) = 1 + maxH⊆G δ(H), is an upper bound for its c...
AbstractThe total chromatic number χt(G) of a graph G is the least number of colors needed to color ...
The b-chromatic number of a graph G, chi_b(G), is the largest integer k such that G has a k-vertex c...
AbstractThe total-chromatic number χT(G) is the least number of colours needed to colour the vertice...
AbstractWe give a new upper bound on the total chromatic number of a graph. This bound improves the ...
A total colouring is the assignment of a colour to each vertex and edge of a graph such that no adja...
A b-coloring of a graph is a proper coloring such that every color class contains a vertex that is a...
AbstractIt is well known that the problem of graph k-colourability, for any k≥3, is NP-complete but ...
A Grundy k-coloring of a graph G, is a vertex k-coloring of G such that for each two colors i and j ...
In this paper it is proved that the problem of determining the total chromatic number of an arbitrar...
AbstractThe total chromatic number χT(G) of a graph G is the least number of colours needed to colou...
Let G be a simple graph. An IE-total coloring f of G is a coloring of the vertices and edges of G so...
AbstractWe show that a regular graph G of order at least 6 whose complement Ḡ is bipartite has total...
A graph is $k$-total colourable if there is an assignment of $k$ different colours to the vertices a...
AbstractThe total chromatic number χT(G) of a graph G is the minimum number of colours needed to col...
The colouring number of a graph G, defined as col(G) = 1 + maxH⊆G δ(H), is an upper bound for its c...
AbstractThe total chromatic number χt(G) of a graph G is the least number of colors needed to color ...
The b-chromatic number of a graph G, chi_b(G), is the largest integer k such that G has a k-vertex c...
AbstractThe total-chromatic number χT(G) is the least number of colours needed to colour the vertice...
AbstractWe give a new upper bound on the total chromatic number of a graph. This bound improves the ...
A total colouring is the assignment of a colour to each vertex and edge of a graph such that no adja...
A b-coloring of a graph is a proper coloring such that every color class contains a vertex that is a...
AbstractIt is well known that the problem of graph k-colourability, for any k≥3, is NP-complete but ...
A Grundy k-coloring of a graph G, is a vertex k-coloring of G such that for each two colors i and j ...
DOI
Add to ORKG