Resource-sharing systems and hypergraph colorings

DOI10.1007/s10878-010-9295-9zbMath1236.90106OpenAlexW1972056074MaRDI QIDQ411210

Gerard Jennhwa Chang, Wu-Hsiung Lin

Publication date: 4 April 2012

Published in: Journal of Combinatorial Optimization (Search for Journal in Brave)

Full work available at URL: http://ntur.lib.ntu.edu.tw/bitstream/246246/238865/-1/19.pdf

zbMATH Keywords

hypergraphcircular chromatic numberfractional chromatic numberresource-sharing system

Mathematics Subject Classification ID

Combinatorial optimization (90C27) Resource and cost allocation (including fair division, apportionment, etc.) (91B32)

Cites Work

• Unnamed Item
• Unnamed Item
• What must be contained in every oriented k-uniform hypergraph
• Oriented hypergraphs, stability numbers and chromatic numbers
• Homomorphisms to powers of digraphs
• The interleaved multichromatic number of a graph
• On the orientation of graphs and hypergraphs
• Resource-sharing system scheduling and circular chromatic number
• Star chromatic number
• A Theorem on n-Coloring the Points of a Linear Graph
• On (k,d)-colorings and fractional nowhere-zero flows
• Circular colorings of edge-weighted graphs
• Sharing resources at nonuniform access rates
• Circular chromatic number: A survey

This page was built for publication: Resource-sharing systems and hypergraph colorings