On chromaticity of hypergraphs

DOI10.1016/J.DISC.2005.11.079zbMath1119.05040OpenAlexW2069085582MaRDI QIDQ878636

Ewa Łazuka, Mieczysław Borowiecki

Publication date: 26 April 2007

Published in: Discrete Mathematics (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.disc.2005.11.079

zbMATH Keywords

hypergraphchromatic polynomialhypertree

Mathematics Subject Classification ID

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

Related Items (8)

Plurigraph coloring and scheduling problems ⋮ Some properties of chromatic coefficients of linear uniform hypergraphs ⋮ On P-unique hypergraphs ⋮ Chromatic polynomials of mixed hypercycles ⋮ Problems on chromatic polynomials of hypergraphs ⋮ Chromatic polynomials of hypergraphs ⋮ On k-chromatically unique and k-chromatically equivalent hypergraphs ⋮ On chromatic polynomials of hypergraphs

Cites Work

• Unnamed Item
• Unnamed Item
• Chromatic coefficients of linear uniform hypergraphs
• A broken-circuits-theorem for hypergraphs
• On chromatic equivalence of graphs
• On chromaticity of graphs
• Chromatic polynomials of hypergraphs

This page was built for publication: On chromaticity of hypergraphs