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

DOI10.1016/J.DISC.2013.02.007zbMATH Open1261.05024OpenAlexW98770169MaRDI QIDQ1945950FDOQ1945950

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

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

zbMATH Keywords

shiftingintersecting hypergraphsemi-strong coloringsemi-strong chromatic numberweak coloring

Mathematics Subject Classification ID

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

Cites Work

• Title not available (Why is that?)
• Semi-strong colouring of intersecting hypergraphs

Cited In (3)

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

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)