Two hypergraphs H and G are said to be chromatically equivalent or χ-equivalent, written H∼G, if P(H,λ)=P(G,λ). A simple hypergraph H is chromatically unique if ...
Sunflower hypergraphs are chromatically unique | Request PDF
www.researchgate.net › ... › Hypergraphs
In a recent paper, Borowiecki and Lazuka showed that h-hypergraphs having the property that any two edges overlap in a fixed (h−1)-subset of vertices are ...
A simple hypergraph H is said to be chromatically unique if H is isomorphic to H ′ for every simple hypergraph H ′ such that H ′ ∼ H ; that is, the structure of ...
May 31, 2012 · Keywords: Quasi-linear hypergraph, Sunflower hypergraph, Quasi ... 3 are chromatically unique in the set of h h -uniform r r -quasi ...
[PDF] Chromatic polynomials of some sunflower mixed hypergraphs
libres.uncg.edu › ecsu › Allagan_M...
Tomescu, Sunflower hypergraphs are chromatically unique, Discrete Math. 285. (2004), 355-357. 9. I. Tomescu, On the chromaticity of sunflower hypergraphs SH ...
A simple hypergraph H is said to be chromatically unique if H is isomorphic to H′ for every simple hypergraph H′ such that H′ ∼ H; that is, the structure of H ...
top 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- ...
Chromatic polynomials of some sunflower mixed hypergraphs ... A vertex is called simplicial if its neighborhood induces a uniquely colorable mixed hypergraph.
When the vertices of a hyperedge are allcolored with the same color, the hyperedge is said to bemonochromatic. Inthe event the vertices are all colored ...
This paper presents an alternative proof of Walter's result and extends his formula to those of non-uniform C-sunflowers and B-Sunflowers, and some results ...