DOIAbstract
AbstractWe determine the strong total chromatic number of the complete h-uniform hypergraph Knh and the complete h-partite hypergraph Kn1,n2,…,nhh
AbstractWe determine the strong total chromatic number of the complete h-uniform hypergraph Knh and the complete h-partite hypergraph Kn1,n2,…,nhh
AbstractA colouring of the vertices of a hypergraph G is called strong if, for every edgeA , the col...
AbstractIn this paper, formulae are given for the coefficients of the highest powers ofλin the chrom...
AbstractLet H be ak-uniform hypergraph in which no two edges share more thantcommon vertices, and le...
AbstractWe determine the strong total chromatic number of the complete h-uniform hypergraph Knh and ...
We determine the strong total chromatic number of the complete h-uniform hypergraph Knh and the comp...
AbstractA strong colouring of a hypergraph is an assignment of colours to its vertices so that no tw...
A complete c-colouring of a graph is a proper colouring in which every pair of distinct colours from...
AbstractThe total chromatic number χT(G) of a graph G is the least number of colours needed to colou...
AbstractThe concept of star chromatic number of a graph, introduced by Vince (1988) is a natural gen...
AbstractWe give a new upper bound on the total chromatic number of a graph. This bound improves the ...
AbstractF(n, r, k) is defined to be the minimum number of edges in an r graph on n vertices in which...
AbstractIn this paper, the author defines a hypergraph total chromatic number and determines this nu...
A hypergraph $V(\mathcal{G})$ is an ordered pair$\mathcal{G}=(V(\mathcal{G}),E(\mathcal{G}))$ where ...
Let c be an edge-colouring of the complete n-graph Kn with m colours. A totally multicoloured (TMC) ...
AbstractWe present coloring algorithms for several strong coloring problems and analyze their perfor...
AbstractA colouring of the vertices of a hypergraph G is called strong if, for every edgeA , the col...
AbstractIn this paper, formulae are given for the coefficients of the highest powers ofλin the chrom...
AbstractLet H be ak-uniform hypergraph in which no two edges share more thantcommon vertices, and le...
AbstractWe determine the strong total chromatic number of the complete h-uniform hypergraph Knh and ...
We determine the strong total chromatic number of the complete h-uniform hypergraph Knh and the comp...
AbstractA strong colouring of a hypergraph is an assignment of colours to its vertices so that no tw...
A complete c-colouring of a graph is a proper colouring in which every pair of distinct colours from...
AbstractThe total chromatic number χT(G) of a graph G is the least number of colours needed to colou...
AbstractThe concept of star chromatic number of a graph, introduced by Vince (1988) is a natural gen...
AbstractWe give a new upper bound on the total chromatic number of a graph. This bound improves the ...
AbstractF(n, r, k) is defined to be the minimum number of edges in an r graph on n vertices in which...
AbstractIn this paper, the author defines a hypergraph total chromatic number and determines this nu...
A hypergraph $V(\mathcal{G})$ is an ordered pair$\mathcal{G}=(V(\mathcal{G}),E(\mathcal{G}))$ where ...
Let c be an edge-colouring of the complete n-graph Kn with m colours. A totally multicoloured (TMC) ...
AbstractWe present coloring algorithms for several strong coloring problems and analyze their perfor...
AbstractA colouring of the vertices of a hypergraph G is called strong if, for every edgeA , the col...
AbstractIn this paper, formulae are given for the coefficients of the highest powers ofλin the chrom...
AbstractLet H be ak-uniform hypergraph in which no two edges share more thantcommon vertices, and le...
Add to ORKG