Cite
Reexploring the upper bound for the chromatic number of graphs.
MLA
Li Shuchao, and Mao Jingzhong. “Reexploring the Upper Bound for the Chromatic Number of Graphs.” Progress in Natural Science, vol. 14, no. 3, Mar. 2004, pp. 276–78. EBSCOhost, https://doi.org/10.1080/10020070412331343461.
APA
Li Shuchao, & Mao Jingzhong. (2004). Reexploring the upper bound for the chromatic number of graphs. Progress in Natural Science, 14(3), 276–278. https://doi.org/10.1080/10020070412331343461
Chicago
Li Shuchao, and Mao Jingzhong. 2004. “Reexploring the Upper Bound for the Chromatic Number of Graphs.” Progress in Natural Science 14 (3): 276–78. doi:10.1080/10020070412331343461.