Resource-sharing systems and hypergraph colorings
From MaRDI portal
Recommendations
Cites work
- A Theorem on n-Coloring the Points of a Linear Graph
- Circular chromatic number: A survey
- Circular colorings of edge-weighted graphs
- Homomorphisms to powers of digraphs
- scientific article; zbMATH DE number 2192158 (Why is no real title available?)
- scientific article; zbMATH DE number 3400923 (Why is no real title available?)
- On (k,d)-colorings and fractional nowhere-zero flows
- On the orientation of graphs and hypergraphs
- Oriented hypergraphs, stability numbers and chromatic numbers
- Resource-sharing system scheduling and circular chromatic number
- Sharing resources at nonuniform access rates
- Star chromatic number
- The interleaved multichromatic number of a graph
- What must be contained in every oriented k-uniform hypergraph
Cited in
(3)
This page was built for publication: Resource-sharing systems and hypergraph colorings
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q411210)