A polyhedral study of the acyclic coloring problem
From MaRDI portal
Publication:5891089
DOI10.1016/j.endm.2009.11.007zbMath1268.05064MaRDI QIDQ5891089
Publication date: 19 July 2013
Published in: Electronic Notes in Discrete Mathematics (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.endm.2009.11.007
05C15: Coloring of graphs and hypergraphs
Related Items
Cites Work
- Unnamed Item
- Minimum feedback vertex set and acyclic coloring.
- Coloring with no 2-colored \(P_4\)'s
- A cutting plane algorithm for graph coloring
- A branch-and-cut algorithm for graph coloring
- Estimation of Sparse Jacobian Matrices and Graph Coloring Blems
- Estimation of sparse hessian matrices and graph coloring problems
- Acyclic coloring of graphs
- Acyclic list 7‐coloring of planar graphs
- The Cyclic Coloring Problem and Estimation of Sparse Hessian Matrices
- Acyclic colorings of planar graphs