APA (7th ed.) Citation

Xu, L., Miao, Z., & Wang, Y. (2014). Every planar graph with cycles of length neither 4 nor 5 is $$(1,1,0)$$-colorable. Journal of Combinatorial Optimization, 28(4), 774. https://doi.org/10.1007/s10878-012-9586-4

Chicago Style (17th ed.) Citation

Xu, Lingji, Zhengke Miao, and Yingqian Wang. "Every Planar Graph with Cycles of Length Neither 4 nor 5 Is $$(1,1,0)$$-colorable." Journal of Combinatorial Optimization 28, no. 4 (2014): 774. https://doi.org/10.1007/s10878-012-9586-4.

MLA (9th ed.) Citation

Xu, Lingji, et al. "Every Planar Graph with Cycles of Length Neither 4 nor 5 Is $$(1,1,0)$$-colorable." Journal of Combinatorial Optimization, vol. 28, no. 4, 2014, p. 774, https://doi.org/10.1007/s10878-012-9586-4.