On chromatic and achromatic numbers of uniform hypergraphs
Ernest Jucovič, František Olejník (1974)
Časopis pro pěstování matematiky
Similarity:
The search session has expired. Please query the service again.
The search session has expired. Please query the service again.
The search session has expired. Please query the service again.
The search session has expired. Please query the service again.
The search session has expired. Please query the service again.
The search session has expired. Please query the service again.
The search session has expired. Please query the service again.
The search session has expired. Please query the service again.
Displaying similar documents to “Some results on chromatic polynomials of hypergraphs.”
On chromatic and achromatic numbers of uniform hypergraphs
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.
On edge independence numbers and edge covering numbers of -uniform hypergraph
František Olejník (1989)
Mathematica Slovaca
Similarity:
On a problem of R. Häggkvist concerning edge-colourings of graphs
Bohdan Zelinka (1978)
Časopis pro pěstování matematiky
Similarity:
A note on embedding hypertrees.
Loh, Po-Shen (2009)
The Electronic Journal of Combinatorics [electronic only]
Similarity: