On a theorem of Erdős, Rubin, and Taylor on choosability of complete bipartite graphs.
Kostochka, Alexandr (2002)
The Electronic Journal of Combinatorics [electronic only]
Similarity:
Displaying similar documents to “Constrained Colouring and σ-Hypergraphs”
On a theorem of Erdős, Rubin, and Taylor on choosability of complete bipartite graphs.
On chromatic and achromatic numbers of uniform hypergraphs
Ernest Jucovič, František Olejník (1974)
Časopis pro pěstování matematiky
Similarity:
On edge independence numbers and edge covering numbers of -uniform hypergraph
František Olejník (1989)
Mathematica Slovaca
Similarity:
Chromatic Polynomials of Mixed Hypercycles
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 ...
Pattern hypergraphs.
Dvořák, Zdeněk, Kára, Jan, Král', Daniel, Pangrác, Ondřej (2010)
The Electronic Journal of Combinatorics [electronic only]
Similarity:
Some results on chromatic polynomials of hypergraphs.
Walter, Manfred (2009)
The Electronic Journal of Combinatorics [electronic only]
Similarity:
Gaps in the chromatic spectrum of face-constrained plane graphs.
Kobler, Daniel, Kündgen, André (2001)
The Electronic Journal of Combinatorics [electronic only]
Similarity:
Hypergraphs with Pendant Paths are not Chromatically Unique
Ioan Tomescu (2014)
Discussiones Mathematicae Graph Theory
Similarity:
In this note it is shown that every hypergraph containing a pendant path of length at least 2 is not chromatically unique. The same conclusion holds for h-uniform r-quasi linear 3-cycle if r ≥ 2.
One More Turán Number and Ramsey Number for the Loose 3-Uniform Path of Length Three
Joanna Polcyn (2017)
Discussiones Mathematicae Graph Theory
Similarity:
Let P denote a 3-uniform hypergraph consisting of 7 vertices a, b, c, d, e, f, g and 3 edges {a, b, c}, {c, d, e}, and {e, f, g}. It is known that the r-color Ramsey number for P is R(P; r) = r + 6 for r ≤ 9. The proof of this result relies on a careful analysis of the Turán numbers for P. In this paper, we refine this analysis further and compute the fifth order Turán number for P, for all n. Using this number for n = 16, we confirm the formula R(P; 10) = 16.