State canonization and early pruning in width-based automated theorem proving

DOI10.4230/LIPICS.FSCD.2024.33MaRDI QIDQ6874974zbMATH OpenFDO

Authors Mateus de Oliveira Oliveira, Farhad Vadiee

Publication date 14 January 2026

Copyright license Creative Commons Attribution 4.0 International

Full work available at URL https://doi.org/10.4230/LIPICS.FSCD.2024.33

zbMATH Keywords

dynamic programmingparameterized complexitywidth-based automated theorem proving

Mathematics Subject Classification ID

Theory of computing (68Qxx)

Cites work

• Automata for the verification of monadic second-order graph properties
• Determining the Smallest k Such That G Is k-Outerplanar
• Equitable colorings of bounded treewidth graphs
• Game chromatic number of outerplanar graphs
• Graph Classes: A Survey
• Hadwiger's conjecture is true for almost every graph
• scientific article; zbMATH DE number 1286500 (Why is no real title available?)
• scientific article; zbMATH DE number 1420226 (Why is no real title available?)
• Is the five-flow conjecture almost false?
• On dominating sets of maximal outerplanar graphs
• On the bend-number of planar and outerplanar graphs
• On triangulating \(k\)-outerplanar graphs
• Oriented vertex and arc colorings of outerplanar graphs
• The monadic second-order logic of graphs. I: Recognizable sets of finite graphs
• Tight relation between the circular chromatic number and the girth of series-parallel graphs
• Treewidth. Computations and approximations
• Triangle-free graphs of tree-width \(t\) are \(\lceil (t+3)/2 \rceil\)-colorable
• Tutte's 3-flow conjecture for almost even graphs

This page was built for publication: State canonization and early pruning in width-based automated theorem proving

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6874974)