Cite
Optimal Acyclic Edge Colouring of Grid Like Graphs.
MLA
Chen, Danny Z., et al. “Optimal Acyclic Edge Colouring of Grid Like Graphs.” Computing & Combinatorics (9783540369257), 2006, pp. 360–67. EBSCOhost, https://doi.org/10.1007/11809678_38.
APA
Chen, D. Z., Lee, D. T., Muthu, R., Narayanan, N., & Subramanian, C. R. (2006). Optimal Acyclic Edge Colouring of Grid Like Graphs. In Computing & Combinatorics (9783540369257) (pp. 360–367). https://doi.org/10.1007/11809678_38
Chicago
Chen, Danny Z., D. T. Lee, Rahul Muthu, N. Narayanan, and C. R. Subramanian. 2006. “Optimal Acyclic Edge Colouring of Grid Like Graphs.” In Computing & Combinatorics (9783540369257), 360–67. doi:10.1007/11809678_38.