Three new upper bounds on the chromatic number
From MaRDI portal
Publication:765327
DOI10.1016/J.DAM.2011.08.005zbMATH Open1236.05087OpenAlexW2022155559MaRDI QIDQ765327FDOQ765327
Authors: María Soto, André Rossi, 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
Recommendations
Cites Work
- Title not available (Why is that?)
- A cutting plane algorithm for graph coloring
- New methods to color the vertices of a graph
- An upper bound for the chromatic number of a graph and its application to timetabling problems
- The sandwich theorem
- A Column Generation Approach for Graph Coloring
- Coloring graphs by iterated local search traversing feasible and infeasible solutions
- Mixed graph edge coloring
- An ant-based algorithm for coloring graphs
- New upper bounds for the chromatic number of a graph
- Title not available (Why is that?)
Cited In (8)
- Graph coloring approach with new upper bounds for the chromatic number: team building application
- Efficient SAT-based minimal model generation methods for modal logic S5
- Towards effective exact methods for the maximum balanced biclique problem in bipartite graphs
- On chromatic number and clique number in \(k\)-step Hamiltonian graphs
- New results on upper bounds for the chromatic number of fuzzy graphs and their complements
- Title not available (Why is that?)
- Improved bounds for the chromatic number of a graph
- Reexploring the upper bound for the chromatic number of graphs
This page was built for publication: Three new upper bounds on the chromatic number
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q765327)
