A polyhedral study of the acyclic coloring problem
From MaRDI portal
Publication:5916097
DOI10.1016/j.dam.2012.03.005zbMath1259.05056MaRDI QIDQ5916097
Javier Marenco, Diego Delle Donne, Mónica Braga
Publication date: 22 November 2012
Published in: Discrete Applied Mathematics (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.dam.2012.03.005
90C10: Integer programming
05C15: Coloring of graphs and hypergraphs
05C85: Graph algorithms (graph-theoretic aspects)
Related Items
Uses Software
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Acyclic colorings of products of trees
- Cycle-based facets of chromatic scheduling polytopes
- Acyclic and \(k\)-distance coloring of the grid
- On the acyclic chromatic number of Hamming graphs
- Acyclic 5-choosability of planar graphs with neither 4-cycles nor chordal 6-cycles
- Parametric shortest path algorithms with an application to cyclic staffing
- A characterization of the minimum cycle mean in a digraph
- On acyclic colorings of planar graphs
- Minimum feedback vertex set and acyclic coloring.
- Coloring with no 2-colored \(P_4\)'s
- Acyclic coloring of graphs of maximum degree five: nine colors are enough
- A cutting plane algorithm for graph coloring
- A branch-and-cut algorithm for graph coloring
- Efficient Computation of Sparse Hessians Using Coloring and Automatic Differentiation
- Acyclic 5-choosability of planar graphs without small cycles
- New Acyclic and Star Coloring Algorithms with Application to Computing Hessians
- Estimation of sparse hessian matrices and graph coloring problems
- Acyclic Colourings of Planar Graphs with Large Girth
- Acyclic coloring of graphs
- Acyclic list 7‐coloring of planar graphs
- The Cyclic Coloring Problem and Estimation of Sparse Hessian Matrices
- On the acyclic choosability of graphs
- What Color Is Your Jacobian? Graph Coloring for Computing Derivatives
- Acyclic colorings of planar graphs
- Acyclic colouring of 1-planar graphs
