Colouring planar mixed hypergraphs.
Kündgen, André, Mendelsohn, Eric, Voloshin, Vitaly (2000)
The Electronic Journal of Combinatorics [electronic only]
Similarity:
Kündgen, André, Mendelsohn, Eric, Voloshin, Vitaly (2000)
The Electronic Journal of Combinatorics [electronic only]
Similarity:
Ernest Jucovič, František Olejník (1974)
Časopis pro pěstování matematiky
Similarity:
Kostochka, Alexandr V., Stiebitz, Michael (2008)
The Electronic Journal of Combinatorics [electronic only]
Similarity:
Dvořák, Zdeněk, Kára, Jan, Král', Daniel, Pangrác, Ondřej (2010)
The Electronic Journal of Combinatorics [electronic only]
Similarity:
Julian A. Allagan, David Slutzky (2014)
Discussiones Mathematicae Graph Theory
Similarity:
We color the vertices of each of the edges of a C-hypergraph (or cohypergraph) in such a way that at least two vertices receive the same color and in every proper coloring of a B-hypergraph (or bihypergraph), we forbid the cases when the vertices of any of its edges are colored with the same color (monochromatic) or when they are all colored with distinct colors (rainbow). In this paper, we determined explicit formulae for the chromatic polynomials of C-hypercycles and B-hypercycles ...
Stanislav Jendroľ, Štefan Schrötter (2008)
Czechoslovak Mathematical Journal
Similarity:
We introduce the rainbowness of a polyhedron as the minimum number such that any colouring of vertices of the polyhedron using at least colours involves a face all vertices of which have different colours. We determine the rainbowness of Platonic solids, prisms, antiprisms and ten Archimedean solids. For the remaining three Archimedean solids this parameter is estimated.
Jozef Fiamčík (1971)
Matematický časopis
Similarity:
Chen, Ailian, Zhang, Fuji, Li, Hao (2008)
The Electronic Journal of Combinatorics [electronic only]
Similarity:
Yair Caro, Josef Lauri, Christina Zarb (2015)
Discussiones Mathematicae Graph Theory
Similarity:
A constrained colouring or, more specifically, an (α, β)-colouring of a hypergraph H, is an assignment of colours to its vertices such that no edge of H contains less than α or more than β vertices with different colours. This notion, introduced by Bujtás and Tuza, generalises both classical hypergraph colourings and more general Voloshin colourings of hypergraphs. In fact, for r-uniform hypergraphs, classical colourings correspond to (2, r)-colourings while an important instance of...