Improving lower bounds for equitable chromatic number

DOI10.1016/j.cor.2022.105790OpenAlexW3169701912MaRDI QIDQ2147053

Emanuel Florentin Olariu, Cristian Frăsinaru

Publication date: 22 June 2022

Published in: Computers \& Operations Research (Search for Journal in Brave)

Full work available at URL: https://arxiv.org/abs/2106.03409

zbMATH Keywords

integer linear programmingequitable coloringassignment modelpartial ordering model

Mathematics Subject Classification ID

Integer programming (90C10) Coloring of graphs and hypergraphs (05C15) Operations research and management science (90Bxx)

Related Items

Optimal secret share distribution in degree splitting communication networks

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• A DSATUR-based algorithm for the equitable coloring problem
• A branch-and-cut algorithm for the equitable coloring problem using a formulation by representatives
• A fast algorithm for equitable coloring
• New integer linear programming models for the vertex coloring problem
• A polyhedral approach for the equitable coloring problem
• A cutting plane algorithm for graph coloring
• A survey on vertex coloring problems
• A Tabu Search Heuristic for the Equitable Coloring Problem
• A Column Generation Approach for Graph Coloring
• Equitable Coloring
• Equitable Coloring of Graphs. Recent Theoretical Results and New Practical Algorithms
• Perfect Graphs and an Application to Optimizing Municipal Services