A lower bound for the packing chromatic number of the Cartesian product of cycles (Q1955603): Difference between revisions

@@ Property / full work available at URL @@
+https://doi.org/10.2478/s11533-013-0237-5
+Normal rank
@@ Property / OpenAlex ID @@
+W2000352522
@@ Property / OpenAlex ID: W2000352522 / rank @@
+Normal rank
@@ Property / cites work @@
+On the packing chromatic number of Cartesian products, hexagonal lattice, and trees
+Normal rank
@@ Property / cites work @@
+Q3065457
@@ Property / cites work: Q3065457 / rank @@
+Normal rank
@@ Property / cites work @@
+Complexity of the packing coloring problem for trees
+Normal rank
@@ Property / cites work @@
+The packing chromatic number of infinite product graphs
+Normal rank
@@ Property / cites work @@
+On the packing chromatic number of some lattices
@@ Property / cites work: On the packing chromatic number of some lattices / rank @@
+Normal rank
@@ Property / cites work @@
+Q3070232
@@ Property / cites work: Q3070232 / rank @@
+Normal rank
@@ Property / cites work @@
+A note on packing chromatic number of the square lattice
+Normal rank