The packing chromatic number of the infinite square lattice is between 13 and 15-Reference-Cited by-同舟云学术

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

Published:2017-07 Issue: Volume:225 Page:136-142
ISSN:0166-218X
Container-title:Discrete Applied Mathematics
language:en
Short-container-title:Discrete Applied Mathematics

Author:

Martin Barnaby,Raimondi Franco,Chen Taolue,Martin Jos

Funder

EPSRC

Publisher

Elsevier BV

Subject

Applied Mathematics,Discrete Mathematics and Combinatorics

Reference23 articles.

1. On the packing chromatic number of Cartesian products, hexagonal lattice, and trees;Brešar;Discrete Appl. Math.,2007

2. Packing chromatic number, (1, 1, 2, 2)-colorings, and characterizing the Petersen graph;Brešar;Aequationes Math.,2017

3. Satisfiability and computing van der Waerden numbers;Dransfield;Electron. J. Combin.,2004

4. J. Ekstein, J. Fiala, P. Holub, B. Lidický, The packing chromatic number of the square lattice is at least 12, 2011. CoRR https://arxiv.org/abs/1003.2291

5. Complexity of the packing coloring problem for trees;Fiala;Discrete Appl. Math.,2010

Cited by 19 articles. 订阅此论文施引文献订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献

1. The Packing Chromatic Number of the Infinite Square Grid is 15;Tools and Algorithms for the Construction and Analysis of Systems;2023

2. A characterization of 4-χρ-(vertex-)critical graphs;Filomat;2022

3. S-packing colorings of distance graphs G(Z,{2,t});Discrete Applied Mathematics;2021-07

4. Independence number and packing coloring of generalized Mycielski graphs;Discussiones Mathematicae Graph Theory;2021

5. On the packing chromatic number of Moore graphs;Discrete Applied Mathematics;2021-01