A polyhedral study of the acyclic coloring problem
From MaRDI portal
Recommendations
- A polyhedral study of the acyclic coloring problem
- 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
- Acyclic edge coloring of planar graphs with large girth
Cites work
- A branch-and-cut algorithm for graph coloring
- A characterization of the minimum cycle mean in a digraph
- A cutting plane algorithm for graph coloring
- Acyclic 5-choosability of planar graphs with neither 4-cycles nor chordal 6-cycles
- Acyclic 5-choosability of planar graphs without small cycles
- Acyclic and \(k\)-distance coloring of the grid
- Acyclic coloring of graphs
- Acyclic coloring of graphs of maximum degree five: nine colors are enough
- Acyclic colorings of planar graphs
- Acyclic colorings of products of cycles
- Acyclic colorings of products of trees
- Acyclic colouring of 1-planar graphs
- Acyclic Colourings of Planar Graphs with Large Girth
- Acyclic list 7‐coloring of planar graphs
- Coloring with no 2-colored \(P_4\)'s
- Cycle-based facets of chromatic scheduling polytopes
- Efficient computation of sparse hessians using coloring and automatic differentiation
- Estimation of sparse hessian matrices and graph coloring problems
- scientific article; zbMATH DE number 3616457 (Why is no real title available?)
- scientific article; zbMATH DE number 2044931 (Why is no real title available?)
- scientific article; zbMATH DE number 2090688 (Why is no real title available?)
- Minimum feedback vertex set and acyclic coloring.
- Network flows. Theory, algorithms, and applications.
- New Acyclic and Star Coloring Algorithms with Application to Computing Hessians
- On acyclic colorings of planar graphs
- On the acyclic choosability of graphs
- On the acyclic chromatic number of Hamming graphs
- Parametric shortest path algorithms with an application to cyclic staffing
- The Cyclic Coloring Problem and Estimation of Sparse Hessian Matrices
- What Color Is Your Jacobian? Graph Coloring for Computing Derivatives
Cited in
(8)- Characterizing acyclic graphs by labeling edges
- Exploring the disjunctive rank of some facet-inducing inequalities of the acyclic coloring polytope
- Disjunctive ranks and anti-ranks of some facet-inducing inequalities of the acyclic coloring polytope
- Acyclic orientations with path constraints
- Polychromatic Acyclic Tours in Colored Multigraphs
- Facets based on cycles and cliques for the acyclic coloring polytope
- New Acyclic and Star Coloring Algorithms with Application to Computing Hessians
- A polyhedral study of the acyclic coloring problem
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 Q5916097)
