The packing chromatic number of infinite product graphs (Q1024309): Difference between revisions

@@ Property / DOI @@
-.1016/j.ejc.2008.09.014
@@ Property / DOI: 10.1016/j.ejc.2008.09.014 / rank @@
-Normal rank
@@ Property / MaRDI profile type @@
+MaRDI publication profile
@@ Property / MaRDI profile type: MaRDI publication profile / rank @@
+Normal rank
@@ Property / full work available at URL @@
+https://doi.org/10.1016/j.ejc.2008.09.014
+Normal rank
@@ Property / OpenAlex ID @@
+W2119765243
@@ Property / OpenAlex ID: W2119765243 / rank @@
+Normal rank
@@ Property / cites work @@
+On the packing chromatic number of Cartesian products, hexagonal lattice, and trees
+Normal rank
@@ Property / cites work @@
+Complexity of the packing coloring problem for trees
+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 @@
+Q4523707
@@ Property / cites work: Q4523707 / rank @@
+Normal rank
@@ Property / cites work @@
+Q4820787
@@ Property / cites work: Q4820787 / rank @@
+Normal rank
@@ Property / DOI @@
+.1016/J.EJC.2008.09.014
@@ Property / DOI: 10.1016/J.EJC.2008.09.014 / rank @@
+Normal rank
@@ links / mardi / name / links / mardi / name @@
+Publication:1024309