State canonization and early pruning make width-based theorem proving practical enough to confirm Reed's conjecture on triangle-free graphs of pathwidth 5 and treewidth 3 and to discover counterexamples to invalid strengthenings.
Upper bounds for the zagreb indices and the spectral radius of series-parallel graphs.International Journal of Quantum Chemistry, 107(4):875–878
1 Pith paper cite this work. Polarity classification is still indexing.
1
Pith paper citing it
citation-role summary
background 1
citation-polarity summary
fields
cs.DS 1years
2026 1verdicts
UNVERDICTED 1roles
background 1polarities
background 1representative citing papers
citing papers explorer
-
State Canonization and Early Pruning in Width-Based Automated Theorem Proving
State canonization and early pruning make width-based theorem proving practical enough to confirm Reed's conjecture on triangle-free graphs of pathwidth 5 and treewidth 3 and to discover counterexamples to invalid strengthenings.