Some results on chromatic polynomials of hypergraphs.
Walter, Manfred (2009)
The Electronic Journal of Combinatorics [electronic only]
Similarity:
Displaying similar documents to “On balancing of hypergraphs”
Some results on chromatic polynomials of hypergraphs.
On edge independence numbers and edge covering numbers of -uniform hypergraph
František Olejník (1989)
Mathematica Slovaca
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.
On a problem of R. Häggkvist concerning edge-colourings of graphs
Bohdan Zelinka (1978)
Časopis pro pěstování matematiky
Similarity:
Equitable hypergraph orientations.
Caro, Yair, West, Douglas, Yuster, Raphael (2011)
The Electronic Journal of Combinatorics [electronic only]
Similarity: