The packing chromatic number of the infinite square lattice is between 13 and 15
Martin, Barnaby, Raimondi, Franco ORCID: https://orcid.org/0000-0002-9508-7713, Chen, Taolue and Martin, Jos
(2017)
The packing chromatic number of the infinite square lattice is between 13 and 15.
Discrete Applied Mathematics, 225
.
pp. 136-142.
ISSN 0166-218X
[Article]
(doi:10.1016/j.dam.2017.03.013)
|
PDF
- Final accepted version (with author's formatting)
Available under License Creative Commons Attribution-NonCommercial-NoDerivatives 4.0. Download (246kB) | Preview |
Abstract
Using a SAT-solver on top of a partial previously-known solution we improve the upper bound of the packing chromatic number of the infinite square lattice from 17 to 15. We discuss the merits of SAT-solving for this kind of problem as well as compare the performance of different encodings. Further, we improve the lower bound from 12 to 13 again using a SAT-solver, demonstrating the versatility of this technology for our approach.
Item Type: | Article |
---|---|
Research Areas: | A. > School of Science and Technology > Computer Science > Foundations of Computing group |
Item ID: | 22019 |
Useful Links: | |
Depositing User: | Taolue Chen |
Date Deposited: | 15 Jun 2017 16:16 |
Last Modified: | 29 Nov 2022 20:46 |
URI: | https://eprints.mdx.ac.uk/id/eprint/22019 |
Actions (login required)
![]() |
View Item |
Statistics
Additional statistics are available via IRStats2.