A heuristic approach for searching \((d, n)\)-packing colorings of infinite lattices (Q1730261): Difference between revisions

@@ Property / cites work @@
+On the packing chromatic number of Cartesian products, hexagonal lattice, and trees
+Normal rank
@@ Property / cites work @@
+The packing chromatic number of infinite product graphs
+Normal rank
@@ Property / cites work @@
+Q3070232
@@ Property / cites work: Q3070232 / rank @@
+Normal rank
@@ Property / cites work @@
+The S-packing chromatic number of a graph
@@ Property / cites work: The S-packing chromatic number of a graph / rank @@
+Normal rank
@@ Property / cites work @@
+A note on \(S\)-packing colorings of lattices
@@ Property / cites work: A note on \(S\)-packing colorings of lattices / rank @@
+Normal rank
@@ Property / cites work @@
+Q3005852
@@ Property / cites work: Q3005852 / rank @@
+Normal rank
@@ Property / cites work @@
+On the packing chromatic number of square and hexagonal lattice
+Normal rank
@@ Property / cites work @@
+\((d, n)\)-packing colorings of infinite lattices
@@ Property / cites work: \((d, n)\)-packing colorings of infinite lattices / rank @@
+Normal rank
@@ Property / cites work @@
+The packing chromatic number of the infinite square lattice is between 13 and 15
+Normal rank
@@ Property / cites work @@
+A note on packing chromatic number of the square lattice
+Normal rank