Using Hajós’ Construction to Generate Hard Graph 3-Colorability Instances
In this paper we propose a constructive algorithm using constraint propagation to generate 4-critical graph units (4-CGUs) which have only one triangle as subgraph. Based on these units we construct 4-critical graphs using Hajós’ join construction. By choosing Grotztsch graph as the initial graph and carefully selecting the edge to be joined, we make sure that the generated graphs are 4-critical and triangle-free. Experiments show that these graphs are exceptionally hard for backtracking algorithms adopting Brélaz’s heuristics. We also give some preliminary analysis on the source of hardness.
Unable to display preview. Download preview PDF.
- 4.Johnson, D.S., Trick, M.A. (eds.): Cliques, Coloring, and Satisfiability: Second DIMACS Implementation Challenge, Workshop, October 11-13, 1993. American Mathematical Society, Boston (1996)Google Scholar
- 9.Vlasie, R.D.: Systematic generation of very hard cases for graph 3-colorability. In: Proceedings of 7th IEEE ICTAI (1995)Google Scholar
- 10.Cheeseman, P., Kanefsky, B., Taylor, W.M.: Where the really hard problems are. In: Proceedings of the 12th IJCAI, pp. 331–337 (1991)Google Scholar
- 15.Dechter, R.: Constraint Processing. Morgan Kaufmann, San Francisco (2003)Google Scholar