The packing chromatic number of the infinite square lattice is between 13 and 15

Martin, Barnaby and Raimondi, Franco and 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

Full text is not in this repository.

This item is available in: Library Catalogue

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: 12 Oct 2017 12:55
URI: http://eprints.mdx.ac.uk/id/eprint/22019

Actions (login required)

Edit Item Edit Item