Kaiyang Hu, Mingfang Huang. Every planar graph without 4- and 6-cycles is (2,5)-colorable. // Discrete Mathematics. – 2026. – DOI: 10.1016/j.disc.2026.115206. – URL: https://doi.org/10.1016/j.disc.2026.115206
Kaiyang Hu & Mingfang Huang (2026). Every planar graph without 4- and 6-cycles is (2,5)-colorable. Discrete Mathematics. https://doi.org/10.1016/j.disc.2026.115206
Kaiyang Hu and Mingfang Huang. “Every planar graph without 4- and 6-cycles is (2,5)-colorable.” Discrete Mathematics, 2026. doi:10.1016/j.disc.2026.115206.
@article{Hu2026,
title = {Every planar graph without 4- and 6-cycles is (2,5)-colorable},
author = {Hu, Kaiyang and Huang, Mingfang},
journal = {Discrete Mathematics},
year = {2026},
doi = {10.1016/j.disc.2026.115206},
url = {https://doi.org/10.1016/j.disc.2026.115206}
}