The complexity of nonrepetitive coloring (Q1003751): Difference between revisions

@@ Property / full work available at URL @@
+https://doi.org/10.1016/j.dam.2008.04.015
+Normal rank
@@ Property / OpenAlex ID @@
+W1976058117
@@ Property / OpenAlex ID: W1976058117 / rank @@
+Normal rank
@@ Property / cites work @@
+Nonrepetitive colorings of graphs
@@ Property / cites work: Nonrepetitive colorings of graphs / rank @@
+Normal rank
@@ Property / cites work @@
+Color-coding
@@ Property / cites work: Color-coding / rank @@
+Normal rank
@@ Property / cites work @@
+Notes on nonrepetitive graph colouring
@@ Property / cites work: Notes on nonrepetitive graph colouring / rank @@
+Normal rank
@@ Property / cites work @@
+Estimation of sparse hessian matrices and graph coloring problems
+Normal rank
@@ Property / cites work @@
+Pattern avoidance: themes and variations
@@ Property / cites work: Pattern avoidance: themes and variations / rank @@
+Normal rank
@@ Property / cites work @@
+Q4217593
@@ Property / cites work: Q4217593 / rank @@
+Normal rank
@@ Property / cites work @@
+Parametrized complexity theory.
@@ Property / cites work: Parametrized complexity theory. / rank @@
+Normal rank
@@ Property / cites work @@
+Thue type problems for graphs, points, and numbers
+Normal rank
@@ Property / cites work @@
+Q3424780
@@ Property / cites work: Q3424780 / rank @@
+Normal rank
@@ Property / cites work @@
+Q4529547
@@ Property / cites work: Q4529547 / rank @@
+Normal rank
@@ Property / cites work @@
+Star chromatic number
@@ Property / cites work: Star chromatic number / rank @@
+Normal rank