Coloring unit-distance strips using SAT

DOI10.29007/BTMJMaRDI QIDQ7024196zbMATH OpenFDO

Authors Peter Oostema, Ruben Martins, Marijn J. H. Heule

Publication date 20 February 2025

Full work available at URL https://doi.org/10.29007/BTMJ

zbMATH Keywords

chromatic number of the planegraph coloringSAT solving

Mathematics Subject Classification ID

Coloring of graphs and hypergraphs (05C15) Problem solving in the context of artificial intelligence (heuristics, search strategies, etc.) (68T20)

Cites work

• -colorings of strips
• All unit-distance graphs of order 6197 are 6-colorable
• Another look at graph coloring via propositional satisfiability
• Graph minimization, focusing on the example of 5-chromatic unit-distance graphs in the plane
• scientific article; zbMATH DE number 3068973 (Why is no real title available?)
• On the chromatic number of subsets of the Euclidean plane
• Tearing a strip off the plane
• The chromatic number of the plane is at least 5
• The Mathematical Coloring Book

Cited in

(1)

• Isomorphisms of unit distance graphs of layers

This page was built for publication: Coloring unit-distance strips using SAT

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