Table of Contents Author Guidelines Submit a Manuscript
International Journal of Mathematics and Mathematical Sciences
Volume 2007, Article ID 74639, 10 pages
http://dx.doi.org/10.1155/2007/74639
Review Article

Nonrepetitive Colorings of Graphs—A Survey

1Algorithmics Research Group, Faculty of Mathematics and Computer Science, Jagiellonian University, Kraków 30-387, Poland
2Department of Didactics of Mathematics and Number Theory, Faculty of Mathematics, Computer Science, and Econometrics, University of Zielona Góra, Zielona Góra 65-516, Poland

Received 8 August 2006; Revised 4 November 2006; Accepted 29 November 2006

Academic Editor: George E. Andrews

Copyright © 2007 Jarosław Grytczuk. This is an open access article distributed under the Creative Commons Attribution License, which permits unrestricted use, distribution, and reproduction in any medium, provided the original work is properly cited.

Citations to this Article [23 citations]

The following is the list of published articles that have cited the current article.

  • Daqing Yang, “Generalization of transitive fraternal augmentations for directed graphs and its applications,” Discrete Mathematics, vol. 309, no. 13, pp. 4614–4623, 2009. View at Publisher · View at Google Scholar
  • Noga Alon, Jarosław Grytczuk, Michał Lasoń, and Mateusz Michałek, “Splitting necklaces and measurable colorings of the real line,” Proceedings of the American Mathematical Society, vol. 137, no. 5, pp. 1593–1599, 2009. View at Publisher · View at Google Scholar
  • Jarosław Grytczuk, Jakub Przybyło, and Xuding Zhu, “Nonrepetitive list colourings of paths,” Random Structures & Algorithms, vol. 38, no. 1-2, pp. 162–173, 2010. View at Publisher · View at Google Scholar
  • Francesca Fiorenzi, Pascal Ochem, Patrice Ossona de Mendez, and Xuding Zhu, “Thue choosability of trees,” Discrete Applied Mathematics, vol. 159, no. 17, pp. 2045–2049, 2011. View at Publisher · View at Google Scholar
  • Jaroslav Nešetřil, Patrice Ossona de Mendez, and David R. Wood, “Characterisations and examples of graph classes with bounded expansion,” European Journal of Combinatorics, vol. 33, no. 3, pp. 350–373, 2012. View at Publisher · View at Google Scholar
  • Jarosław Grytczuk, Jakub Kozik, and Piotr Micek, “New approach to nonrepetitive sequences,” Random Structures & Algorithms, vol. 42, no. 2, pp. 214–225, 2012. View at Publisher · View at Google Scholar
  • Jochen Harant, and Stanislav Jendrol', “Nonrepetitive vertex colorings of graphs,” Discrete Mathematics, vol. 312, no. 2, pp. 374–380, 2012. View at Publisher · View at Google Scholar
  • Pascal Ochem, and Elise Vaslet, “Repetition Thresholds For Subdivided Graphs And Trees,” Rairo-Theoretical Informatics and Applications, vol. 46, no. 1, pp. 123–130, 2012. View at Publisher · View at Google Scholar
  • Kashyap Kolipaka, Mario Szegedy, and Yixin Xu, “A sharper local lemma with improved applications,” Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics), vol. 7408, pp. 603–614, 2012. View at Publisher · View at Google Scholar
  • Cláudia Linhares-Sales, Ana Karolinna Maia, Nicolas Martins, and Rudini M. Sampaio, “Restricted coloring problems on Graphs with few P 4’s,” Annals of Operations Research, 2014. View at Publisher · View at Google Scholar
  • Jakub Przybylo, “On the Facial Thue Choice Index via Entropy Compression,” Journal of Graph Theory, vol. 77, no. 3, pp. 180–189, 2014. View at Publisher · View at Google Scholar
  • Jakub Przybyło, Jens Schreyer, and Erika Škrabul’áková, “On the Facial Thue Choice Number of Plane Graphs Via Entropy Compression Method,” Graphs and Combinatorics, 2015. View at Publisher · View at Google Scholar
  • Huanhua Zhao, and Xuding Zhu, “$$(2+\epsilon )$$ ( 2 + ϵ ) -Nonrepetitive List Colouring of Paths,” Graphs and Combinatorics, 2015. View at Publisher · View at Google Scholar
  • Xuding Zhu, and Yaling Zhong, “Fractional Thue chromatic number of graphs,” Discrete Applied Mathematics, vol. 200, pp. 191–199, 2016. View at Publisher · View at Google Scholar
  • Vida Dujmović, Gwenaël Joret, Jakub Kozik, and David R. Wood, “Nonrepetitive colouring via entropy compression,” Combinatorica, vol. 36, no. 6, pp. 661–686, 2016. View at Publisher · View at Google Scholar
  • Michel Rigopp. 1–268, 2016. View at Publisher · View at Google Scholar
  • Nina Kamčev, Tomasz Łuczak, and Benny Sudakov, “Anagram-free colorings of graphs,” Electronic Notes in Discrete Mathematics, vol. 61, pp. 671–677, 2017. View at Publisher · View at Google Scholar
  • Vida Dujmović, Pat Morin, and David R. Wood, “Layered separators in minor-closed graph classes with applications,” Journal of Combinatorial Theory, Series B, 2017. View at Publisher · View at Google Scholar
  • Anton Bernshteyn, “The Local Cut Lemma,” European Journal of Combinatorics, vol. 63, pp. 95–114, 2017. View at Publisher · View at Google Scholar
  • Prosenjit Bose, Vida Dujmović, Pat Morin, and Lucas Rioux-Maldague, “New Bounds for Facial Nonrepetitive Colouring,” Graphs and Combinatorics, 2017. View at Publisher · View at Google Scholar
  • David G. Harris, and Aravind Srinivasan, “Algorithmic and Enumerative Aspects of the Moser-Tardos Distribution,” ACM Transactions on Algorithms, vol. 13, no. 3, pp. 1–40, 2017. View at Publisher · View at Google Scholar
  • Július Czap, and Stanislav Jendrol, “Facially-constrained colorings of plane graphs: A survey,” Discrete Mathematics, vol. 340, no. 11, pp. 2691–2703, 2017. View at Publisher · View at Google Scholar
  • Július Czap, Stanislav Jendrol, and Roman Soták, “Facial anagram-free edge-coloring of plane graphs,” Discrete Applied Mathematics, vol. 230, pp. 151–155, 2017. View at Publisher · View at Google Scholar