DOIAbstract
We determine the strong total chromatic number of the complete h-uniform hypergraph Knh and the complete h-partite hypergraph Kn1,n2,nhh. © 1995.SCOPUS: ar.jinfo:eu-repo/semantics/publishe
We determine the strong total chromatic number of the complete h-uniform hypergraph Knh and the complete h-partite hypergraph Kn1,n2,nhh. © 1995.SCOPUS: ar.jinfo:eu-repo/semantics/publishe
The strong chromatic index of a graph is the minimum number of colours needed to colour the edges i...
We show that the total chromatic number of a simple k-chromatic graph exceeds the chromatic index by...
The upper chromatic number χ(H) of a hypergraph H is the maximum number of colors in a coloring avoi...
AbstractWe determine the strong total chromatic number of the complete h-uniform hypergraph Knh and ...
AbstractIn this paper, the author defines a hypergraph total chromatic number and determines this nu...
AbstractA strong colouring of a hypergraph is an assignment of colours to its vertices so that no tw...
AbstractA colouring of the vertices of a hypergraph G is called strong if, for every edgeA , the col...
AbstractThe total chromatic number χT(G) of a graph G is the least number of colours needed to colou...
In a graph, by definition, the weight of a (proper) coloring with positive integers is the sum of th...
Let F be a family of r-uniform hypergraphs. The chromatic threshold of F is the infimum of all non-n...
Fix an integer k ≥ 3. A k-uniform hypergraph is simple if every two edges share at most one vertex. ...
In a graph, by definition, the weight of a (proper) coloring with positive integers is the sum of th...
Graphs and AlgorithmsThe strong chromatic index of a graph is the minimum number of colours needed t...
AbstractWe give a new upper bound on the total chromatic number of a graph. This bound improves the ...
AbstractThe first author showed that the list chromatic number of every graph with average degree d ...
The strong chromatic index of a graph is the minimum number of colours needed to colour the edges i...
We show that the total chromatic number of a simple k-chromatic graph exceeds the chromatic index by...
The upper chromatic number χ(H) of a hypergraph H is the maximum number of colors in a coloring avoi...
AbstractWe determine the strong total chromatic number of the complete h-uniform hypergraph Knh and ...
AbstractIn this paper, the author defines a hypergraph total chromatic number and determines this nu...
AbstractA strong colouring of a hypergraph is an assignment of colours to its vertices so that no tw...
AbstractA colouring of the vertices of a hypergraph G is called strong if, for every edgeA , the col...
AbstractThe total chromatic number χT(G) of a graph G is the least number of colours needed to colou...
In a graph, by definition, the weight of a (proper) coloring with positive integers is the sum of th...
Let F be a family of r-uniform hypergraphs. The chromatic threshold of F is the infimum of all non-n...
Fix an integer k ≥ 3. A k-uniform hypergraph is simple if every two edges share at most one vertex. ...
In a graph, by definition, the weight of a (proper) coloring with positive integers is the sum of th...
Graphs and AlgorithmsThe strong chromatic index of a graph is the minimum number of colours needed t...
AbstractWe give a new upper bound on the total chromatic number of a graph. This bound improves the ...
AbstractThe first author showed that the list chromatic number of every graph with average degree d ...
The strong chromatic index of a graph is the minimum number of colours needed to colour the edges i...
We show that the total chromatic number of a simple k-chromatic graph exceeds the chromatic index by...
The upper chromatic number χ(H) of a hypergraph H is the maximum number of colors in a coloring avoi...
Add to ORKG