On the \(c\)-strong chromatic number of \(t\)-intersecting hypergraphs

DOI10.1016/J.DISC.2013.02.007zbMath1261.05024OpenAlexW98770169MaRDI QIDQ1945950

Ping Ngai Chung

Publication date: 17 April 2013

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

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

zbMATH Keywords

intersecting hypergraphshiftingsemi-strong coloringsemi-strong chromatic numberweak coloring

Mathematics Subject Classification ID

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

Related Items (2)

Coloring 2-intersecting hypergraphs ⋮ Semi-Strong Colouring of Intersecting Hypergraphs

Cites Work

• Semi-Strong Colouring of Intersecting Hypergraphs
• Unnamed Item

This page was built for publication: On the \(c\)-strong chromatic number of \(t\)-intersecting hypergraphs