Hill, O., Smith, D., Wang, Y., Xu, L., & Yu, G. (2013). Planar graphs without cycles of length 4 or 5 are -colorable. Discrete Mathematics, 313(20), 2312. https://doi.org/10.1016/j.disc.2013.06.009
Chicago Style (17th ed.) CitationHill, Owen, Diana Smith, Yingqian Wang, Lingji Xu, and Gexin Yu. "Planar Graphs Without Cycles of Length 4 or 5 Are -colorable." Discrete Mathematics 313, no. 20 (2013): 2312. https://doi.org/10.1016/j.disc.2013.06.009.
MLA (9th ed.) CitationHill, Owen, et al. "Planar Graphs Without Cycles of Length 4 or 5 Are -colorable." Discrete Mathematics, vol. 313, no. 20, 2013, p. 2312, https://doi.org/10.1016/j.disc.2013.06.009.
Warning: These citations may not always be 100% accurate.