The cost chromatic number and hypergraph parameters

DOI10.7151/DMGT.1329MaRDI QIDQ5437220zbMATH OpenOpenAlexFDO

Authors Gábor Bacsó, Zsolt Tuza

Publication date 18 January 2008

Published in Discussiones Mathematicae Graph Theory (Search for Journal in Brave)

Full work available at URL https://semanticscholar.org/paper/1ce703d5b6ba3256053b8e78bf43b7060d24af20

zbMATH Keywords

graph coloringscost chromatic numberintersection number of hypergraphs

Mathematics Subject Classification ID

Extremal problems in graph theory (05C35) Coloring of graphs and hypergraphs (05C15) Graph representations (geometric and intersection representations, etc.) (05C62) Hypergraphs (05C65)

Recommendations

• The complexity of chromatic strength and chromatic edge strength
• Minimal coloring and strength of graphs
• The chromatic sum of a graph: history and recent developments
• The strong chromatic index of graphs with edge weight eight
• The strong edge-coloring for graphs with small edge weight

Cited in

(3)

• scientific article; zbMATH DE number 2068132 (Why is no real title available?)
• Optimal guard sets and the Helly property
• scientific article; zbMATH DE number 3937210 (Why is no real title available?)

This page was built for publication: The cost chromatic number and hypergraph parameters

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