On the c-strong chromatic number of t-intersecting hypergraphs

DOI10.1016/J.DISC.2013.02.007MaRDI QIDQ1945950zbMATH OpenOpenAlexFDO

Authors 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 hypergraphsemi-strong chromatic numbersemi-strong coloringshiftingweak coloring

Mathematics Subject Classification ID

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

Recommendations

• Semi-strong colouring of intersecting hypergraphs
• Coloring 2-intersecting hypergraphs
• On the strong chromatic number of random hypergraphs
• On the strong chromatic number of a random 3-uniform hypergraph
• Approximation and Online Algorithms

Cites work

• scientific article; zbMATH DE number 4029608 (Why is no real title available?)
• Semi-strong colouring of intersecting hypergraphs

Cited in

(3)

• The strong intersecting number of a graph
• Coloring 2-intersecting hypergraphs
• Semi-strong colouring of intersecting hypergraphs

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

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