Upper and lower bounds based on linear programming for the b-coloring problem

DOI10.1016/j.ejco.2022.100049zbMath1528.90270MaRDI QIDQ6114961

Xiaochen Chou, Derek H. Smith, Roberto Montemanni

Publication date: 12 July 2023

Published in: EURO Journal on Computational Optimization (Search for Journal in Brave)

zbMATH Keywords

linear programmingB-coloringgraph coloring bounds

Mathematics Subject Classification ID

Programming involving graphs or networks (90C35) Mixed integer programming (90C11) Coloring of graphs and hypergraphs (05C15)

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Hybrid evolutionary algorithm for the b-chromatic number
• The b-chromatic number of a graph
• Lower bounds for fixed spectrum frequency assignment
• An improved algorithm to determine lower bounds for the fixed spectrum frequency assignment problem
• A matheuristic approach for the \(b\)-coloring problem using integer programming and a multi-start multi-greedy randomized metaheuristic
• The \(b\)-chromatic index of graphs
• The \(b\)-chromatic index of direct product of graphs
• On the \(b\)-continuity property of graphs
• An integer programming approach to b-coloring
• A survey on vertex coloring problems

This page was built for publication: Upper and lower bounds based on linear programming for the b-coloring problem