The packing chromatic number of the infinite square grid is 15

DOI10.1007/978-3-031-30823-9_20zbMATH Open1546.05066MaRDI QIDQ6535369

Bernardo Subercaseaux, Marijn J. H. Heule

Publication date: 13 December 2023

zbMATH Keywords

verificationSATpacking coloring

Mathematics Subject Classification ID

Coloring of graphs and hypergraphs (05C15) Distance in graphs (05C12) Computational aspects of satisfiability (68R07)

Cites Work

• Title not available (Why is that?)
• The packing chromatic number of the infinite square lattice is between 13 and 15
• On the packing chromatic number of some lattices
• The packing chromatic number of infinite product graphs
• Every planar map is four colorable. I: Discharging
• On a generalization of extended resolution
• DRAT proofs, propagation redundancy, and extended resolution
• A survey on packing colorings
• What a difference a variable makes
• A note on packing chromatic number of the square lattice
• A survey on the distance-colouring of graphs
• Tighter bounds on directed Ramsey number \(R(7)\)
• The Hadwiger–Nelson Problem
• The packing chromatic number of the infinite square grid is at least 14

Related Items (3)

Packing coloring of hypercubes with extended Hamming codes ⋮ On uniquely packable trees ⋮ Partial packing coloring and quasi-packing coloring of the triangular grid

This page was built for publication: The packing chromatic number of the infinite square grid is 15

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