Volume 54, Number 6, November-December 2020
|Page(s)||1863 - 1874|
|Published online||16 September 2020|
Facets based on cycles and cliques for the acyclic coloring polytope
Sciences Institute, National University of General Sarmiento, J.M. Gutierrez 1150, B1613 GSX Los Polvorines, Argentina
* Corresponding author: email@example.com
Accepted: 19 October 2019
A coloring of a graph is an assignment of colors to its vertices such that any two vertices receive distinct colors whenever they are adjacent. An acyclic coloring is a coloring such that no cycle receives exactly two colors, and the acyclic chromatic number χA(G) of a graph G is the minimum number of colors in any such coloring of G. Given a graph G and an integer k, determining whether χA(G) ≤ k or not is NP-complete even for k = 3. The acyclic coloring problem arises in the context of efficient computations of sparse and symmetric Hessian matrices via substitution methods. In a previous work we presented facet-inducing families of valid inequalities based on induced even cycles for the polytope associated to an integer programming formulation of the acyclic coloring problem. In this work we continue with this study by introducing new families of facet-inducing inequalities based on combinations of even cycles and cliques.
Mathematics Subject Classification: 90C10 / 05C15 / 90C27
Key words: Acyclic coloring / polyhedral combinatorics / combinatorial optimization
© EDP Sciences, ROADEF, SMAI 2020
Current usage metrics show cumulative count of Article Views (full-text article views including HTML views, PDF and ePub downloads, according to the available data) and Abstracts Views on Vision4Press platform.
Data correspond to usage on the plateform after 2015. The current usage metrics is available 48-96 hours after online publication and is updated daily on week days.
Initial download of the metrics may take a while.