Three new upper bounds on the chromatic number
From MaRDI portal
Publication:765327
DOI10.1016/j.dam.2011.08.005zbMath1236.05087OpenAlexW2022155559MaRDI QIDQ765327
André Rossi, María Soto, Marc Sevaux
Publication date: 19 March 2012
Published in: Discrete Applied Mathematics (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.dam.2011.08.005
Related Items (3)
Unnamed Item ⋮ Towards effective exact methods for the maximum balanced biclique problem in bipartite graphs ⋮ Efficient SAT-based minimal model generation methods for modal logic S5
Cites Work
- Unnamed Item
- Unnamed Item
- Mixed graph edge coloring
- The sandwich theorem
- A cutting plane algorithm for graph coloring
- An ant-based algorithm for coloring graphs
- Coloring graphs by iterated local search traversing feasible and infeasible solutions
- New upper bounds for the chromatic number of a graph
- New methods to color the vertices of a graph
- A Column Generation Approach for Graph Coloring
- An upper bound for the chromatic number of a graph and its application to timetabling problems
This page was built for publication: Three new upper bounds on the chromatic number