BIROn - Birkbeck Institutional Research Online

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

    Martin, B. and Raimondi, F. and Chen, Taolue and Martin, J. (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.

    [img]
    Preview
    Text
    19652.pdf - Author's Accepted Manuscript

    Download (249kB) | 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.

    Metadata

    Item Type: Article
    Keyword(s) / Subject(s): Packing chromatic number, Broadcast chromatic number, Graph colouring, SAT solving
    School: Birkbeck Schools and Departments > School of Business, Economics & Informatics > Computer Science and Information Systems
    Depositing User: Dr Taolue Chen
    Date Deposited: 19 Sep 2017 14:44
    Last Modified: 18 Apr 2018 00:10
    URI: http://eprints.bbk.ac.uk/id/eprint/19652

    Statistics

    Downloads
    Activity Overview
    31Downloads
    66Hits

    Additional statistics are available via IRStats2.

    Archive Staff Only (login required)

    Edit/View Item Edit/View Item