Abstract
The 3-Colouring of a graph is a classic NP-complete problem. We show that some solutions for the 3-Colouring can be built in polynomial time based on the number of basic cycles existing in the graph. For this, we design a reduction from proper 3-Colouring of a graph G to a 2-CF Boolean formula F G , where the number of clauses in F G depends on the number of basic cycles in G. Any model of F G provides a proper 3-Colouring of G. Thus, F G is a logical pattern whose models codify proper 3-Colouring of the graph G.
Chapter PDF
Similar content being viewed by others
References
Alon, N., Kahale, N.: A spectral technique for coloring random 3-colorable graphs. SIAM Jour. Comput. 26(6), 1733–1748 (1997), http://www.research.att.com/kahale/papers/jour.ps
Beigel, R., Eppstein, D.: 3-coloring in time O(1.3289n). Journal of Algorithms 54(2), 168–204 (2005)
Blum, A., Karger, D.: An O(n 3/14)-coloring algorithm for 3-colorable graphs. Inf. Proc. Lett. 61(1), 49–53 (1997), http://www.cs.cmu.edu/http://www.cs.cmu.edu/avrim/Papers/color_new.ps.gz
Bodlaender H.L., Kratsch D.: An exact algorithm for graph coloring with polynomial memory. Technical Report UU-CS-2006-015 (2006), http://www.cs.uu.nl
Byskov J.M.: Exact Algorithms for graph colouring and exact satisifiability. Phd thesis, University of Aarbus, Denmark (2005)
Cormen, T.H., Leiserson, C.E., Rivest, R.L., Stein, C.: Introduction to Algorithms, 3rd edn. MIT Press, Cambridge (2009)
Golumbic, M.C.: Algorithmic Graph Theory and Perfect Graphs, 2nd edn. North-Holland, Amsterdam (2004)
Greenhill, C.: The complexity of counting colourings and independent sets in sparse graphs and hypergraphs. Computational Complexity (1999)
Grötschel, M., Lovász, L., Schrijver, A.: The ellipsoid method and its consequences in combinatorial optimization. Combinatorica 1, 169–197 (1981)
William, K., Kreher Donald, L.: Graphs, Algorithms, and Optimization. Chapman & Hall/CRC, Boca Raton (2005)
Lawler, E.: A note on the complexity of the chromatic number problem. Information Processing Letters 5, 66–67 (1976)
Stacho, J.: 3-Colouring AT-Free Graphs in Polynomial Time. In: Cheong, O., Chwa, K.-Y., Park, K. (eds.) ISAAC 2010, Part II. LNCS, vol. 6507, pp. 144–155. Springer, Heidelberg (2010)
Vlasie, R.D.: Systematic generation of very hard cases for graph 3-colorability. In: Proc. 7th-IEEE Int. Conf. Tools with Artificial Intelligence, pp. 114–119 (1995)
Wilson, R.A.: Graphs, Colourings and the Four-colour Theorem. Oxford University Press, Oxford (2002)
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2011 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
De Ita, G., Bautista, C., Altamirano, L.C. (2011). Solving 3-Colouring via 2SAT. In: Martínez-Trinidad, J.F., Carrasco-Ochoa, J.A., Ben-Youssef Brants, C., Hancock, E.R. (eds) Pattern Recognition. MCPR 2011. Lecture Notes in Computer Science, vol 6718. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-642-21587-2_6
Download citation
DOI: https://doi.org/10.1007/978-3-642-21587-2_6
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-642-21586-5
Online ISBN: 978-3-642-21587-2
eBook Packages: Computer ScienceComputer Science (R0)