Open Access
| Issue |
RAIRO-Oper. Res.
Volume 60, Number 2, March-April 2026
|
|
|---|---|---|
| Page(s) | 615 - 624 | |
| DOI | https://doi.org/10.1051/ro/2026014 | |
| Published online | 18 March 2026 | |
- V.G. Vizing, Vertex colorings with given colors. Metody Diskret. Anal. Novosibirsk 29 (1976) 3–10 (in Russian). [Google Scholar]
- P. Erdős, A. Rubin and H. Taylor, Choosability in graphs. Congr. Numer. 26 (1979) 125–157. [Google Scholar]
- T. Jensen and B. Toft, Graph Coloring Problems. Wiley, New York (1995). [Google Scholar]
- N. Alon and M. Tarsi, Colorings and orientations of graphs. Combinatorica 12 (1992) 125–134. [CrossRef] [MathSciNet] [Google Scholar]
- C. Thomassen, Every planar graph is 5-choosable. J. Comb. Theory, Ser. B 62 (1994) 180–181. [Google Scholar]
- M. Voigt, List colourings of planar graphs. Discrete Math. 120 (1993) 215–219. [Google Scholar]
- S. Gutner, The complexity of planar graph choosability. Discrete Math. 159 (1996) 119–130. [Google Scholar]
- W. Cushing and H.A. Kierstead, Planar graphs are 1-relaxed, 4-choosable. Eur. J. Comb. 31 (2010) 1385–1397. [Google Scholar]
- G. Fijavž, M. Juvan, B. Mohar and R. Škrekovski, Planar graphs without cycles of specific lengths. Eur. J. Comb. 23 (2002) 377–388. [Google Scholar]
- P.C.B. Lam, B. Xu and J. Liu, The 4-choosability of plane graphs without 4-cycles. J. Comb. Theory, Ser. B 76 (1999) 117–126. [Google Scholar]
- W. Wang and K.-W. Lih, The 4-choosability of planar graphs without 6-cycles. Australas. J. Comb. 24 (2001) 157–164. [Google Scholar]
- W. Wang and K.-W. Lih, Choosability and edge choosability of planar graphs without five cycles. Appl. Math. Lett. 15 (2002) 561–565. [Google Scholar]
- P. Cheng, M. Chen and Y. Wang, Planar graphs without 4-cycles adjacent to triangles are 4-choosable. Discrete Math. 339 (2016) 3052–3057. [Google Scholar]
- X. Zhu, The Alon-Tarsi number of planar graphs. J. Comb. Theory, Ser. B 134 (2019) 354–358. [Google Scholar]
- J. Grytczuk and X. Zhu, The Alon-Tarsi number of a planar graph minus a matching. J. Comb. Theory, Ser. B (2020) 511–520. [Google Scholar]
- H. Lu and X. Zhu, The Alon-Tarsi number of planar graphs without cycles of length 4 and 1. Discrete Math. 343 (2020). [Google Scholar]
- M. Voigt, A not 3-choosable planar graph without 3-cycles. Discrete Math. 146 (1995) 325–328. [Google Scholar]
- X. Zhu and R. Balakrishnan, Alon-Tarsi Theorem and Its Applications (2021). [Google Scholar]
Current usage metrics show cumulative count of Article Views (full-text article views including HTML views, PDF and ePub downloads, according to the available data) and Abstracts Views on Vision4Press platform.
Data correspond to usage on the plateform after 2015. The current usage metrics is available 48-96 hours after online publication and is updated daily on week days.
Initial download of the metrics may take a while.