Publisher
Springer Science and Business Media LLC
Reference15 articles.
1. Alon, N., Tarsi, M.: Colorings and orientations of graphs. Combinatorica 12, 125–134 (1992)
2. Chen, M., Lih, K., Wang, W.: On choosability with separation of planar graphs without adjacent short cycles. B. Malays. Math. Sci. So. 41, 1507–1518 (2018)
3. Ding, L., Wang, G., Wu, J., Yu, J.: Neighbor sum (set) distinguishing total choosability via the combinatorial Nullstellensatz. Graphs Combin. 33, 885–900 (2017)
4. Erd?s,P., Rubin,A. L., Taylor,H.: Choosability in graphs. In: Proceedings of the West Coast Conference on Combinatorics, Graph Theory and Computing, Arcata, California, Congressus Numeratium XXVI (1979)
5. Hu, D., Wu, J.: Planar graphs without intersecting 5-cycles are 4-choosable. Discrete Math. 340, 1788–1792 (2017)