scientific article; zbMATH DE number 1759407

MaRDI QIDQ4536356zbMATH OpenFDO

Authors Eowyn Cenek, Timothy M. Chan, Erik D. Demaine, Martin L. Demaine, Rudolf Fleischer, Ming-wei Wang, Therese Biedl

Publication date 13 October 2002

Mathematics Subject Classification ID

Coloring of graphs and hypergraphs (05C15) Graph algorithms (graph-theoretic aspects) (05C85) Graph theory (including graph drawing) in computer science (68R10)

Recommendations

• On balanced colorings of hypergraphs
• Balanced coloring of bipartite graphs
• Balanced colourings of strongly regular graphs
• Balancing connected colourings of graphs
• Imbalances in k‐colorations
• Good and nice colorings of balanced hypergraphs
• On balanced colorings of the \(n\)-cube
• On balanced colorings of sparse hypergraphs
• Split and balanced colorings of complete graphs

Cited in

(11)

• Balanced colourings of strongly regular graphs
• Semi-balanced colorings of graphs: Generalized 2-colorings based on a relaxed discrepancy condition
• Computing the maximum bichromatic discrepancy, with applications to computer graphics and machine learning
• Balanced polychromatic 2-coloring of triangulations
• The chromatic discrepancy of graphs
• On the \(L_{2}\)-discrepancy
• Balanced interval coloring
• scientific article; zbMATH DE number 2086378 (Why is no real title available?)
• scientific article; zbMATH DE number 881159 (Why is no real title available?)
• Tight hardness results for minimizing discrepancy
• Imbalances in k‐colorations

This page was built for publication:

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4536356)