Unfolding boxes with local constraints

DOI10.1007/978-3-031-99984-0_38MaRDI QIDQ6869917zbMATH OpenFDO

Authors Long Qian, Eric C. Wang, Bernardo Subercaseaux, Marijn J. H. Heule

Publication date 21 January 2026

Copyright license Creative Commons Attribution 4.0 International

Full work available at URL https://doi.org/10.1007/978-3-031-99984-0_38

zbMATH Keywords

box foldinggraph connectivitygraph cyclicitylocal constraintsSAT encodings

Mathematics Subject Classification ID

Mechanization of proofs and logical operations (03B35) Theorem proving (automated and interactive theorem provers, deduction, resolution, etc.) (68V15) Formalization of mathematics in connection with theorem provers (68V20)

Cites work

• A comparison of SAT encodings for acyclicity of directed graphs
• A survey and recent results about commmon developments of two or more boxes
• Common developments of three incongruent boxes of area 30
• Formal verification of the empty hexagon number
• Geometric folding algorithms. Linkages, origami, polyhedra
• SAT modulo graphs: acyclicity
• Unfolding boxes with local constraints

Cited in

(1)

• Unfolding boxes with local constraints

This page was built for publication: Unfolding boxes with local constraints

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