Facial anagram-free edge-coloring of plane graphs (Q2399301): Difference between revisions

@@ Property / author @@
-Stanlislav Jendroľ
@@ Property / author: Stanlislav Jendroľ / rank @@
-Normal rank
@@ Property / author @@
+Stanlislav Jendroľ
@@ Property / author: Stanlislav Jendroľ / 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.dam.2017.06.018
+Normal rank
@@ Property / OpenAlex ID @@
+W2738747769
@@ Property / OpenAlex ID: W2738747769 / rank @@
+Normal rank
@@ Property / cites work @@
+Nonrepetitive colorings of graphs
@@ Property / cites work: Nonrepetitive colorings of graphs / rank @@
+Normal rank
@@ Property / cites work @@
+Facial Nonrepetitive Vertex Coloring of Plane Graphs
+Normal rank
@@ Property / cites work @@
+On square-free vertex colorings of graphs
@@ Property / cites work: On square-free vertex colorings of graphs / rank @@
+Normal rank
@@ Property / cites work @@
+Trees in Polyhedral Graphs
@@ Property / cites work: Trees in Polyhedral Graphs / rank @@
+Normal rank
@@ Property / cites work @@
+Q5422499
@@ Property / cites work: Q5422499 / rank @@
+Normal rank
@@ Property / cites work @@
+New bounds for facial nonrepetitive colouring
@@ Property / cites work: New bounds for facial nonrepetitive colouring / rank @@
+Normal rank
@@ Property / cites work @@
+Nonrepetitive colorings of trees
@@ Property / cites work: Nonrepetitive colorings of trees / rank @@
+Normal rank
@@ Property / cites work @@
+Is There a Sequence on Four Symbols in Which No Two Adjacent Segments are Permutations of One Another?
+Normal rank
@@ Property / cites work @@
+There are ternary circular square-free words of length \(n\) for \(n \geq\) 18
+Normal rank
@@ Property / cites work @@
+Facially-constrained colorings of plane graphs: a survey
+Normal rank
@@ Property / cites work @@
+Strongly non-repetitive sequences and progression-free sets
+Normal rank
@@ Property / cites work @@
+Nonrepetitive colouring via entropy compression
@@ Property / cites work: Nonrepetitive colouring via entropy compression / rank @@
+Normal rank
@@ Property / cites work @@
+Q3281093
@@ Property / cites work: Q3281093 / rank @@
+Normal rank
@@ Property / cites work @@
+Q5579506
@@ Property / cites work: Q5579506 / rank @@
+Normal rank
@@ Property / cites work @@
+Q4121921
@@ Property / cites work: Q4121921 / rank @@
+Normal rank
@@ Property / cites work @@
+Nonrepetitive colorings of graphs -- a survey
@@ Property / cites work: Nonrepetitive colorings of graphs -- a survey / rank @@
+Normal rank
@@ Property / cites work @@
+Pattern avoidance on graphs
@@ Property / cites work: Pattern avoidance on graphs / rank @@
+Normal rank
@@ Property / cites work @@
+Nonrepetitive vertex colorings of graphs
@@ Property / cites work: Nonrepetitive vertex colorings of graphs / rank @@
+Normal rank
@@ Property / cites work @@
+Facial non-repetitive edge-coloring of plane graphs
+Normal rank
@@ Property / cites work @@
+Q3574506
@@ Property / cites work: Q3574506 / rank @@
+Normal rank
@@ Property / cites work @@
+Anagram-free colorings of graphs
@@ Property / cites work: Anagram-free colorings of graphs / rank @@
+Normal rank
@@ Property / cites work @@
+Abelian squares are avoidable on 4 letters
@@ Property / cites work: Abelian squares are avoidable on 4 letters / rank @@
+Normal rank
@@ Property / cites work @@
+Nonrepetitive colorings of graphs of bounded tree-width
+Normal rank
@@ Property / cites work @@
+Q5646912
@@ Property / cites work: Q5646912 / rank @@
+Normal rank