APA (7th ed.) Citation

Chor, B., Fellows, M., Ragan, M. A., Razgon, I., Rosamond, F., & Snir, S. (2007). Connected Coloring Completion for General Graphs: Algorithms and Complexity. Computing and Combinatorics, 4598, 75-85. https://doi.org/10.1007/978-3-540-73545-8_10

Chicago Style (17th ed.) Citation

Chor, Benny, Michael Fellows, Mark A. Ragan, Igor Razgon, Frances Rosamond, and Sagi Snir. "Connected Coloring Completion for General Graphs: Algorithms and Complexity." Computing and Combinatorics 4598 (2007): 75-85. https://doi.org/10.1007/978-3-540-73545-8_10.

MLA (9th ed.) Citation

Chor, Benny, et al. "Connected Coloring Completion for General Graphs: Algorithms and Complexity." Computing and Combinatorics, vol. 4598, 2007, pp. 75-85, https://doi.org/10.1007/978-3-540-73545-8_10.