Three new upper bounds on the chromatic number
From MaRDI portal
(Redirected from Publication:765327)
Recommendations
Cites work
- scientific article; zbMATH DE number 2099158 (Why is no real title available?)
- scientific article; zbMATH DE number 2203240 (Why is no real title available?)
- A Column Generation Approach for Graph Coloring
- A cutting plane algorithm for graph coloring
- An ant-based algorithm for coloring graphs
- An upper bound for the chromatic number of a graph and its application to timetabling problems
- Coloring graphs by iterated local search traversing feasible and infeasible solutions
- Mixed graph edge coloring
- New methods to color the vertices of a graph
- New upper bounds for the chromatic number of a graph
- The sandwich theorem
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
- scientific article; zbMATH DE number 1507555 (Why is no real title available?)
- 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)
