A polyhedral study of the acyclic coloring problem
From MaRDI portal
Publication:5891089
Recommendations
- A polyhedral study of the acyclic coloring problem
- Acyclic coloring with few division vertices
- Facets based on cycles and cliques for the acyclic coloring polytope
- Disjunctive ranks and anti-ranks of some facet-inducing inequalities of the acyclic coloring polytope
- Improved bounds for acyclic chromatic index of planar graphs
Cites work
- scientific article; zbMATH DE number 2090688 (Why is no real title available?)
- A branch-and-cut algorithm for graph coloring
- A cutting plane algorithm for graph coloring
- Acyclic coloring of graphs
- Acyclic colorings of planar graphs
- Acyclic list 7‐coloring of planar graphs
- Coloring with no 2-colored \(P_4\)'s
- Estimation of Sparse Jacobian Matrices and Graph Coloring Blems
- Estimation of sparse hessian matrices and graph coloring problems
- Minimum feedback vertex set and acyclic coloring.
- The Cyclic Coloring Problem and Estimation of Sparse Hessian Matrices
Cited in
(7)- Exploring the disjunctive rank of some facet-inducing inequalities of the acyclic coloring polytope
- Polychromatic Acyclic Tours in Colored Multigraphs
- Disjunctive ranks and anti-ranks of some facet-inducing inequalities of the acyclic coloring polytope
- A polyhedral study of the acyclic coloring problem
- Characterizing acyclic graphs by labeling edges
- Facets based on cycles and cliques for the acyclic coloring polytope
- Acyclic orientations with path constraints
This page was built for publication: A polyhedral study of the acyclic coloring problem
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5891089)
