Computing Maximum Unavoidable Subgraphs Using SAT Solvers

DOI10.1007/978-3-319-40970-2_13zbMath1475.68236OpenAlexW2479146106MaRDI QIDQ2818013

Marijn J. H. Heule, C. K. Cuong

Publication date: 5 September 2016

Published in: Theory and Applications of Satisfiability Testing – SAT 2016 (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/978-3-319-40970-2_13

zbMATH Keywords

combinatoricsgraph theorysymmetry breakingsatisfiability solvingunavoidable subgraph

Mathematics Subject Classification ID

Graph theory (including graph drawing) in computer science (68R10) Problem solving in the context of artificial intelligence (heuristics, search strategies, etc.) (68T20) Computational aspects of satisfiability (68R07)

Uses Software

• nauty
• Traces
• sharpSAT

Cites Work

• Unnamed Item
• Practical graph isomorphism. II.
• Ramsey numbers for cycles in graphs
• Solving and Verifying the Boolean Pythagorean Triples Problem via Cube-and-Conquer
• A SAT Attack on the Erdős Discrepancy Conjecture
• R(4, 5) = 25

This page was built for publication: Computing Maximum Unavoidable Subgraphs Using SAT Solvers