scientific article; zbMATH DE number 6930532

MaRDI QIDQ4583836zbMATH OpenFDO

Authors Bernd Steinbach, Christian Posthoff

Publication date 3 September 2018

Full work available at URL http://www.oldcitypublishing.com/journals/mvlsc-home/mvlsc-issue-contents/mvlsc-volume-25-number-4-5-2015/mvlsc-25-4-5-p-461-490/

zbMATH Keywords

Boolean equationfour-valued coloringLatin squarepermutation classrectangle-free gridSATsolver

Mathematics Subject Classification ID

Software, source code, etc. for problems pertaining to combinatorics (05-04) Coloring of graphs and hypergraphs (05C15)

Recommendations

• Highly complex 4-colored rectangle-free grids -- solution unsolved multiple-valued problems
• Rectangle-free colorings of extremely complex grids using 4 colors
• scientific article; zbMATH DE number 4134068
• On some coloring problems in grids
• Graph theory of four-colors -- existence and searching method of the solution of the four-color problem
• scientific article; zbMATH DE number 2145230
• The complexity of the four colour theorem
• scientific article; zbMATH DE number 3241107
• Perfect colorings of the infinite rectangular grid

Cited in

(4)

• Rectangle-free colorings of extremely complex grids using 4 colors
• Highly complex 4-colored rectangle-free grids -- solution unsolved multiple-valued problems
• Fast Optimal Synthesis of Symmetric Index Generation Functions
• The complexity of grid coloring

This page was built for publication:

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