A DSATUR-based algorithm for the equitable coloring problem

DOI10.1016/j.cor.2014.11.014zbMath1348.05205arXiv1306.1758OpenAlexW2102068573MaRDI QIDQ337479

Daniel Severín, Isabel Méndez-Díaz, Graciela L. Nasini

Publication date: 10 November 2016

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

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

zbMATH Keywords

exact algorithmequitable coloring\textsc{DSsatur}

Mathematics Subject Classification ID

Programming involving graphs or networks (90C35) Coloring of graphs and hypergraphs (05C15) Graph algorithms (graph-theoretic aspects) (05C85)

Related Items (3)

Improving lower bounds for equitable chromatic number ⋮ Spectrum graph coloring and applications to Wi-Fi channel assignment ⋮ A flow based pruning scheme for enumerative equitable coloring algorithms

Uses Software

• DIMACS

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• A branch-and-cut algorithm for the equitable coloring problem using a formulation by representatives
• Conflict-free star-access in parallel memory systems
• The equitable colorings of Kneser graphs
• Equitable coloring of trees
• A new \textsf{DSATUR}-based algorithm for exact vertex coloring
• A polyhedral approach for the equitable coloring problem
• An Ore-type theorem on equitable coloring
• On the asymmetric representatives formulation for the vertex coloring problem
• A branch-and-cut algorithm for graph coloring
• Compactness and balancing in scheduling
• New methods to color the vertices of a graph
• Equitable Coloring
• Chromatic Scheduling and the Chromatic Number Problem
• Perfect Graphs and an Application to Optimizing Municipal Services

This page was built for publication: A DSATUR-based algorithm for the equitable coloring problem