New results on the robust coloring problem

DOI10.1007/s00025-024-02148-warXiv2201.12650OpenAlexW4393114381MaRDI QIDQ6127005

Rafael Robles, Delia Garijo, Alberto Márquez

Publication date: 10 April 2024

Published in: Results in Mathematics (Search for Journal in Brave)

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

zbMATH Keywords

graph coloringgraph theorydiscrete optimizationrobust coloring

Mathematics Subject Classification ID

Graph theory (including graph drawing) in computer science (68R10) Coloring of graphs and hypergraphs (05C15)

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• A column generation based algorithm for the robust graph coloring problem
• Some simplified NP-complete graph problems
• Bounds for the frequency assignment problem
• The robust coloring problem.
• A graph-based hyper-heuristic for educational timetabling problems
• A branch-and-price algorithm for the robust graph coloring problem
• An application of graph coloring to printed circuit testing
• Equitable Coloring
• Equitable Coloring of Graphs. Recent Theoretical Results and New Practical Algorithms
• Chromatic Graph Theory