{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,6,10]],"date-time":"2026-06-10T07:19:26Z","timestamp":1781075966034,"version":"3.54.1"},"reference-count":0,"publisher":"The Electronic Journal of Combinatorics","issue":"1","content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Electron. J. Combin."],"abstract":"<jats:p>The concept of a packing colouring is related to a frequency assignment problem.  The packing chromatic number $\\chi_p(G)$ of a graph $G$ is the smallest integer $k$ such that the vertex set $V (G)$ can be partitioned into disjoint classes $X_1, \\dots, X_k$, where vertices in $X_i$ have pairwise distance greater than $i$.  In this note we improve the upper bound on the packing chromatic number of the square lattice.<\/jats:p>","DOI":"10.37236\/466","type":"journal-article","created":{"date-parts":[[2020,1,10]],"date-time":"2020-01-10T23:15:54Z","timestamp":1578698154000},"source":"Crossref","is-referenced-by-count":17,"title":["A Note on Packing Chromatic Number of the Square Lattice"],"prefix":"10.37236","volume":"17","author":[{"given":"Roman","family":"Soukal","sequence":"first","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"P\u0159emysl","family":"Holub","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]}],"member":"23455","published-online":{"date-parts":[[2010,3,15]]},"container-title":["The Electronic Journal of Combinatorics"],"original-title":[],"link":[{"URL":"https:\/\/www.combinatorics.org\/ojs\/index.php\/eljc\/article\/download\/v17i1n17\/pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/www.combinatorics.org\/ojs\/index.php\/eljc\/article\/download\/v17i1n17\/pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2020,1,17]],"date-time":"2020-01-17T18:57:34Z","timestamp":1579287454000},"score":1,"resource":{"primary":{"URL":"https:\/\/www.combinatorics.org\/ojs\/index.php\/eljc\/article\/view\/v17i1n17"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2010,3,15]]},"references-count":0,"journal-issue":{"issue":"1","published-online":{"date-parts":[[2010,1,5]]}},"URL":"https:\/\/doi.org\/10.37236\/466","relation":{},"ISSN":["1077-8926"],"issn-type":[{"value":"1077-8926","type":"electronic"}],"subject":[],"published":{"date-parts":[[2010,3,15]]},"article-number":"N17"}}