On k-chromatically unique and k-chromatically equivalent hypergraphs

DOI10.1016/J.ENDM.2006.06.010MaRDI QIDQ3439412zbMATH OpenOpenAlexFDO

Authors Ewa Drgas-Burchardt

Publication date 29 May 2007

Published in Electronic Notes in Discrete Mathematics (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1016/j.endm.2006.06.010

zbMATH Keywords

chromatic polynomials of hypergraphschromatically equivalencecolourings of hypergraphs

Mathematics Subject Classification ID

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

Recommendations

• On 3-chromatically unique and 3-chromatically equivalent hypergraphs
• Chromatic polynomials of hypergraphs
• On the chromaticity of quasi linear hypergraphs
• Chromatic coefficients of linear uniform hypergraphs
• Chromatic polynomials of hypergraphs

Cites work

• An introduction to chromatic polynomials
• scientific article; zbMATH DE number 3758364 (Why is no real title available?)
• On chromatic polynomials of hypergraphs
• On chromaticity of hypergraphs

Cited in

(7)

• Sunflower hypergraphs are chromatically unique
• On 3-chromatically unique and 3-chromatically equivalent hypergraphs
• On H-chromatic uniqueness of two linear uniform cycles having some edges in common
• On P-unique hypergraphs
• Chromatically equivalent k-bridge hypergraphs
• Chromatic polynomials of hypergraphs
• On the chromaticity of sunflower hypergraphs \(\text{SH}(n,p,h)\)

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

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