AbstractIn 1993 Voloshin introduced the concept of mixed hypergraph. A mixed hypergraph is characterised by the fact that it possesses anti-edges as well as edges. In a colouring of a mixed hypergraph, every anti-edge has at least two vertices of the same colour. In this paper a new parameter is introduced: the monochromatic block number mb. It is the number of monochromatic blocks in a colouring of a Steiner system. The exact value of mb is given for every colouring in STS(v). Upper and lower bounds for mb in particular SQSs are found
AbstractA mixed hypergraph consists of two families of subsets: the edges and the co-edges. In a col...
A colouring of a hypergraph's vertices is polychromatic if every hyperedge contains at least one ver...
AbstractA strong colouring of a hypergraph is an assignment of colours to its vertices so that no tw...
AbstractIn 1993 Voloshin introduced the concept of mixed hypergraph. A mixed hypergraph is character...
A mixed hypergraph is characterized by the fact that it possesses anti-edges as well as edges. In a ...
A mixed hypergraph is characterized by the fact that it possesses anti-edges as well as edges. In a ...
A mixed hypergraph is characterized by the fact that it possesses anti-edges as well as edges. In a ...
A mixed hypergraph is characterized by the fact that it possesses anti-edges as well as edges. In a ...
A complete $k$-colouring of a hypergraph is an assignment of $k$ colours to the points such that (1)...
AbstractWe investigate the largest number of colours, called upper chromatic number and denoted X(H)...
A Steiner system S(2, 4, v) is a v-element set V together with a collection B of 4-subsets of V cal...
AbstractThe paper surveys problems, results and methods concerning the coloring of Steiner triple an...
AbstractWe investigate the largest number of colours, called upper chromatic number and denoted X(H)...
A Steiner system S(2, 4, v) is a v-element set V together with a collection B of 4-subsets of V call...
A Steiner triple system of order v, STS(v), is an ordered pair S = (V, B), where V is a set of size...
AbstractA mixed hypergraph consists of two families of subsets: the edges and the co-edges. In a col...
A colouring of a hypergraph's vertices is polychromatic if every hyperedge contains at least one ver...
AbstractA strong colouring of a hypergraph is an assignment of colours to its vertices so that no tw...
AbstractIn 1993 Voloshin introduced the concept of mixed hypergraph. A mixed hypergraph is character...
A mixed hypergraph is characterized by the fact that it possesses anti-edges as well as edges. In a ...
A mixed hypergraph is characterized by the fact that it possesses anti-edges as well as edges. In a ...
A mixed hypergraph is characterized by the fact that it possesses anti-edges as well as edges. In a ...
A mixed hypergraph is characterized by the fact that it possesses anti-edges as well as edges. In a ...
A complete $k$-colouring of a hypergraph is an assignment of $k$ colours to the points such that (1)...
AbstractWe investigate the largest number of colours, called upper chromatic number and denoted X(H)...
A Steiner system S(2, 4, v) is a v-element set V together with a collection B of 4-subsets of V cal...
AbstractThe paper surveys problems, results and methods concerning the coloring of Steiner triple an...
AbstractWe investigate the largest number of colours, called upper chromatic number and denoted X(H)...
A Steiner system S(2, 4, v) is a v-element set V together with a collection B of 4-subsets of V call...
A Steiner triple system of order v, STS(v), is an ordered pair S = (V, B), where V is a set of size...
AbstractA mixed hypergraph consists of two families of subsets: the edges and the co-edges. In a col...
A colouring of a hypergraph's vertices is polychromatic if every hyperedge contains at least one ver...
AbstractA strong colouring of a hypergraph is an assignment of colours to its vertices so that no tw...