Abstract
The cycle double cover conjecture is a famous longstanding unsolved conjecture in graph theory. It is related and can be reduced to the compatible circuit decomposition problem. Recently Fleischner et al. (2018) provided a sufficient condition for a compatible circuit decomposition, which is called SUD-\(K_5\)-minor freeness. In a previous work we developed an abstract mathematical model for finding SUD-\(K_5\)-minors and based on the model a mixed integer linear program (MIP). In this work we propose a respective boolean satisfiability (SAT) model and compare it with the MIP model in computational tests. Non-trivial symmetry breaking constraints are proposed, which improve the solving times of both models considerably. Compared to the MIP model the SAT approach performs significantly better. We use the faster algorithm to further test graphs of graph theoretic interest and were able to get new insights. Among other results we found snarks with 30 and 32 vertices that do not contain a perfect pseudo-matching, that is a spanning subgraph consisting of \(K_2\) and \(K_{1,3}\) components, whose contraction leads to a SUD-\(K_5\)-minor free graph.
This work is supported by the Austrian Science Fund (FWF) under grant P27615 and the Vienna Graduate School on Computational Optimization, grant W1260.
This is a preview of subscription content, log in via an institution to check access.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
References
Aloul, F.A., Ramani, A., Markov, I.L., Sakallah, K.A.: Solving difficult SAT instances in the presence of symmetry. In: Proceedings of the 39th Annual Design Automation Conference, DAC 2002, pp. 731–736. ACM, New York (2002)
Fan, G., Zhang, C.-Q.: Circuit decompositions of Eulerian graphs. J. Comb. Theory Ser. B 78(1), 1–23 (2000)
Fleischner, H.: Eulersche Linien und Kreisüberdeckungen, die vorgegebene Durchgänge in den Kanten vermeiden. J. Comb. Theory Ser. B 29(2), 145–167 (1980)
Fleischner, H., Bagheri Gh., B., Zhang, C.-Q., Zhang, Z.: Cycle covers (III) - Compatible circuit decomposition and K5-transition minor. Technical report, Algorithms and Complexity Group, TU Wien (2018)
Jaeger, F.: A survey of the cycle double cover conjecture. In Alspach, B.R., Godsil, C.D. (eds.) Annals of Discrete Mathematics (27): Cycles in Graphs, volume 115 of North-Holland Mathematics Studies, pp. 1–12. North-Holland (1985)
Janota, M., Grigore, R., Manquinho, V.: On the Quest for an Acyclic Graph. arXiv:1708.01745 (2017)
Januschowski, T., Pfetsch, M.E.: Branch-cut-and-propagate for the maximum k-colorable subgraph problem with symmetry. In: Achterberg, T., Beck, J.C. (eds.) CPAIOR 2011. LNCS, vol. 6697, pp. 99–116. Springer, Heidelberg (2011). https://doi.org/10.1007/978-3-642-21311-3_11
Klocker, B., Fleischner, H., Raidl, G.: A Model for Finding Transition-Minors. Technical report, Algorithms and Complexity Group, TU Wien (2018)
Luks, E.M.: Isomorphism of graphs of bounded valence can be tested in polynomial time. J. Comput. Syst. Sci. 25(1), 42–65 (1982)
McKay, B.D., Piperno, A.: Practical graph isomorphism, II. J. Symbolic Comput. 60, 94–112 (2014)
Seymour, P.D.: Sums of circuits. Graph Theory Relat. Top. 1, 341–355 (1979)
Sims, C.C.: Computational methods in the study of permutation groups. In: Leech, J. (ed.) Computational Problems in Abstract Algebra, pp. 169–183. Pergamon (1970)
Szekeres, G.: Polyhedral decompositions of cubic graphs. Bull. Australian Math. Soc. 8(03), 367 (1973)
Tseitin, G.S.: On the complexity of derivation in propositional calculus. In: Siekmann, J.H., Wrightson, G. (eds.) Automation of Reasoning: 2: Classical Papers on Computational Logic 1967-1970. Symbolic Computation, pp. 466–483. Springer, Heidelberg (1983). https://doi.org/10.1007/978-3-642-81955-1_28
Author information
Authors and Affiliations
Corresponding author
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2020 Springer Nature Switzerland AG
About this paper
Cite this paper
Klocker, B., Fleischner, H., Raidl, G.R. (2020). A SAT Approach for Finding Sup-Transition-Minors. In: Matsatsinis, N., Marinakis, Y., Pardalos, P. (eds) Learning and Intelligent Optimization. LION 2019. Lecture Notes in Computer Science(), vol 11968. Springer, Cham. https://doi.org/10.1007/978-3-030-38629-0_27
Download citation
DOI: https://doi.org/10.1007/978-3-030-38629-0_27
Published:
Publisher Name: Springer, Cham
Print ISBN: 978-3-030-38628-3
Online ISBN: 978-3-030-38629-0
eBook Packages: Mathematics and StatisticsMathematics and Statistics (R0)