A polyhedral approach for graph coloring
From MaRDI portal
Recommendations
Cited in
(34)- Coloring Delaunay-edges and their generalizations
- An exact method for graph coloring
- A unified framework for symmetry handling
- A Wide Branching Strategy for the Graph Coloring Problem
- Solving a multicoloring problem with overlaps using integer programming
- Cliques, holes and the vertex coloring polytope
- A Facility Coloring Problem in 1-D
- An abstract approach to polychromatic coloring: shallow hitting sets in ABA-free hypergraphs and pseudohalfplanes
- A procedure for the strategic planning of locations, capacities and districting of jails: application to Chile
- Facet-generating procedures for the maximum-impact coloring polytope
- Facet-generating procedures for the maximum-impact coloring polytope
- An integer programming approach to b-coloring
- Coloring k-colorable graphs using smaller palettes
- Polyhedral studies of vertex coloring problems: the standard formulation
- Packing and partitioning orbitopes
- The minimum chromatic violation problem: a polyhedral study
- Solving graph coloring problems with the Douglas-Rachford algorithm
- A Game Theoretic Approach for Efficient Graph Coloring
- The distance polytope for the vertex coloring problem
- Branch-cut-and-propagate for the maximum k-colorable subgraph problem with symmetry
- Graph coloring inequalities from all-different systems
- Facets of the graph coloring polytope
- The maximum-impact coloring polytope
- Total coloring and total matching: polyhedra and facets
- A cutting plane algorithm for graph coloring
- A branch-and-cut algorithm for graph coloring
- The minimum chromatic violation problem: a polyhedral approach
- A technique for multicoloring triangle-free hexagonal graphs
- On the asymmetric representatives formulation for the vertex coloring problem
- Polyhedral results for the equitable coloring problem
- Facet-inducing inequalities and a cut-and-branch for the bandwidth coloring polytope based on the orientation model
- Symmetry-breaking inequalities for ILP with structured sub-symmetry
- Faster graph coloring in polynomial space
- A branch-and-price algorithm for the minimum sum coloring problem
This page was built for publication: A polyhedral approach for graph coloring
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2741502)
