Author:
Choi Ilkyoo,Cranston Daniel W.,Pierron Théo
Publisher
Springer Science and Business Media LLC
Subject
Computational Mathematics,Discrete Mathematics and Combinatorics
Reference13 articles.
1. N. Álon and M. Tarsi: Colorings and orientations of graphs, Combinatorial12 (1992), 125–134.
2. O. Amini, L. Esperet and J. van den Heuvel: A unified approach to distance-two colouring of graphs on surfaces, Combinatorial33 (2013), 253–296.
3. M. Bonamy, D. W. Cranston and L. Postle: Planar graphs of girth at least five are square (Δ + 2)-choosable, J. Combin. Theory Ser. B134 (2019), 218–238.
4. O. V. Borodin, A. N. Glebov, A. O. Ivanova, T. K. Neustroeva and V. A. Tashkinov: Sufficient conditions for planar graphs to be 2-distance (Δ + 1)-colorable, Sib. Elektron. Mat. Izv.1 (2004), 129–141.
5. D. W. Cranston and B. Jaeger: List-coloring the squares of planar graphs without 4-cycles and 5-cycles, J. Graph Theory85 (2017), 721–737.