Semi-balanced colorings of graphs: Generalized 2-colorings based on a relaxed discrepancy condition

DOI10.1007/s00373-004-0557-0zbMath1055.05055OpenAlexW2044362391MaRDI QIDQ1889829

Takeshi Tokuyama, Jesper Jansson

Publication date: 13 December 2004

Published in: Graphs and Combinatorics (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/s00373-004-0557-0

zbMATH Keywords

hypergraphchromatic polynomial2-coloringsemi-balanced colorings

Mathematics Subject Classification ID

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

Related Items (2)

The structure and number of global roundings of a graph ⋮ Recent progress on combinatorics and algorithms for low discrepancy roundings

This page was built for publication: Semi-balanced colorings of graphs: Generalized 2-colorings based on a relaxed discrepancy condition