\(S\)-packing colorings of distance graphs \(G ( \mathbb{Z} , \{ 2 , t \} )\)

DOI10.1016/j.dam.2021.04.001zbMath1465.05061arXiv2005.10491OpenAlexW3155130972MaRDI QIDQ2028095

Boštjan Brešar, Jasmina Ferme, Karolína Kamenická

Publication date: 31 May 2021

Published in: Discrete Applied Mathematics (Search for Journal in Brave)

Full work available at URL: https://arxiv.org/abs/2005.10491

zbMATH Keywords

distance graphdistance coloring\(S\)-packing chromatic number\(S\)-packing coloring

Mathematics Subject Classification ID

Coloring of graphs and hypergraphs (05C15) Distance in graphs (05C12)

Related Items (2)

A characterization of 4-\(\chi_S\)-vertex-critical graphs for packing sequences with \(s_1 = 1\) and \(s_2 \geq 3\) ⋮ On \(S\)-packing colourings of distance graphs \(D (1, t)\) and \(D (1, 2, t)\)

Cites Work

• Unnamed Item
• \(S\)-packing colorings of cubic graphs
• Packing chromatic number of distance graphs
• Packing chromatic number, \((1, 1, 2, 2)\)-colorings, and characterizing the Petersen graph
• 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
• Isomorphism of circulant graphs and digraphs
• 2-distance colorings of integer distance graphs
• On the packing chromatic number of subcubic outerplanar graphs
• Packing chromatic number of subdivisions of cubic graphs
• Modeling the packing coloring problem of graphs
• Packing \(( 1 , 1 , 2 , 2 )\)-coloring of some subcubic graphs
• A note on packing chromatic number of the square lattice
• Dichotomies properties on computational complexity of \(S\)-packing coloring problems
• The packing coloring of distance graphs \(D(k,t)\)
• On packing colorings of distance graphs
• A survey on the distance-colouring of graphs
• A note on \(S\)-packing colorings of lattices
• The S-packing chromatic number of a graph
• On the packing chromatic number of square and hexagonal lattice
• Subdivision into i-packings and S-packing chromatic number of some lattices
• Perfect colorings of the infinite circulant graph with distances 1 and 2
• On the packing chromatic number of Cartesian products, hexagonal lattice, and trees

This page was built for publication: \(S\)-packing colorings of distance graphs \(G ( \mathbb{Z} , \{ 2 , t \} )\)