A lower bound for the packing chromatic number of the Cartesian product of cycles

DOI10.2478/s11533-013-0237-5zbMath1266.05121OpenAlexW2000352522MaRDI QIDQ1955603

Elizabeth Jonck, Ernst J. Joubert, Yolandé Jacobs

Publication date: 14 June 2013

Published in: Central European Journal of Mathematics (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.2478/s11533-013-0237-5

zbMATH Keywords

cyclesboundspackingCartesian productchromatic

Mathematics Subject Classification ID

Edge subsets with special properties (factorization, matching, partitioning, covering and packing, etc.) (05C70) Graph operations (line graphs, products, etc.) (05C76)

Related Items (14)

Packing coloring of Sierpiński-type graphs ⋮ Packing chromatic number of base-3 Sierpiński graphs ⋮ An infinite family of subcubic graphs with unbounded packing chromatic number ⋮ Packing chromatic number versus chromatic and clique number ⋮ Independence number and packing coloring of generalized Mycielski graphs ⋮ A note on the packing chromatic number of lexicographic products ⋮ A survey on packing colorings ⋮ Packing colorings of subcubic outerplanar graphs ⋮ On the packing chromatic number of subcubic outerplanar graphs ⋮ Packing chromatic number, \((1, 1, 2, 2)\)-colorings, and characterizing the Petersen graph ⋮ Packing chromatic number under local changes in a graph ⋮ The packing chromatic number of the infinite square lattice is between 13 and 15 ⋮ Modeling the packing coloring problem of graphs ⋮ The packing chromatic number of hypercubes

Cites Work

• Unnamed Item
• Unnamed Item
• Complexity of the packing coloring problem for trees
• On the packing chromatic number of some lattices
• The packing chromatic number of infinite product graphs
• A note on packing chromatic number of the square lattice
• On the packing chromatic number of Cartesian products, hexagonal lattice, and trees

This page was built for publication: A lower bound for the packing chromatic number of the Cartesian product of cycles