Cost colourings of hypergraphs

DOI10.1016/J.DISC.2005.11.067MaRDI QIDQ878618zbMATH OpenOpenAlexFDO

Authors Ewa Drgas-Burchardt, Anna Fiedorowicz

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.067

zbMATH Keywords

Brooks-type theorem

Mathematics Subject Classification ID

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

Recommendations

• On the cost-chromatic number of graphs
• Colorings of hypergraphs
• ON HYPERGRAPH COLOURINGS
• Hypergraph colouring
• Maximal Hypergraphs with Respect to the Bounded Cost Hereditary Property

Cites work

• scientific article; zbMATH DE number 4154469 (Why is no real title available?)
• scientific article; zbMATH DE number 3522018 (Why is no real title available?)
• On the cost-chromatic number of graphs
• The colour theorems of Brooks and Gallai extended
• Tight bounds on the chromatic sum of a connected graph

Cited in

(1)

• Maximal Hypergraphs with Respect to the Bounded Cost Hereditary Property

This page was built for publication: Cost colourings of hypergraphs

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