On 3-chromatically unique and 3-chromatically equivalent hypergraphs

MaRDI QIDQ3011829zbMATH OpenFDO

Authors Ewa Drgas-Burchardt

Publication date 29 June 2011

zbMATH Keywords

chromatic polynomials of hypergraphschromatic uniqueness and equivalencecolourings of hypergraphsSperner hypergraphs

Mathematics Subject Classification ID

Coloring of graphs and hypergraphs (05C15) Hypergraphs (05C65)

Recommendations

• On k-chromatically unique and k-chromatically equivalent hypergraphs
• Chromatic polynomials of hypergraphs
• On H-chromatic uniqueness of two linear uniform cycles having some edges in common
• Chromatic coefficients of linear uniform hypergraphs
• On the chromaticity of quasi linear hypergraphs

Cited in

(6)

• Sunflower hypergraphs are chromatically unique
• A note on the least number of edges of 3-uniform hypergraphs with upper chromatic number 2
• THE UNIQUE EQUIVALENCE CLASS OF CHROMATIC RECTANGLE FREE 3-COLORINGS OF A 10 × 10 CHESSBOARD
• On k-chromatically unique and k-chromatically equivalent hypergraphs
• The chromatic spectrum of 3-uniform bi-hypergraphs
• Chromatically equivalent k-bridge hypergraphs

This page was built for publication: On 3-chromatically unique and 3-chromatically equivalent hypergraphs

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3011829)