The circular chromatic number of hypergraphs
From MaRDI portal
Recommendations
Cites work
- \(C\)-perfect \(K\)-uniform hypergraphs.
- A note on the star chromatic number
- A Theorem on n-Coloring the Points of a Linear Graph
- Circular chromatic number: A survey
- Homomorphisms of 3-chromatic graphs
- scientific article; zbMATH DE number 43754 (Why is no real title available?)
- scientific article; zbMATH DE number 1228446 (Why is no real title available?)
- scientific article; zbMATH DE number 1277120 (Why is no real title available?)
- scientific article; zbMATH DE number 2117181 (Why is no real title available?)
- scientific article; zbMATH DE number 854567 (Why is no real title available?)
- scientific article; zbMATH DE number 2192158 (Why is no real title available?)
- On (k,d)-colorings and fractional nowhere-zero flows
- Resource-sharing system scheduling and circular chromatic number
- Star chromatic number
- Star chromatic numbers and products of graphs
- Star chromatic numbers of hypergraphs and partial Steiner triple systems
Cited in
(7)- On the chromatic number of circulant graphs
- scientific article; zbMATH DE number 3914364 (Why is no real title available?)
- scientific article; zbMATH DE number 2061801 (Why is no real title available?)
- On circular chromatic number and chromatic number of some generalized Kneser hypergraphs.
- Circular chromatic Ramsey number
- scientific article; zbMATH DE number 2192158 (Why is no real title available?)
- Coloring rings
This page was built for publication: The circular chromatic number of hypergraphs
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1045069)