APA (7th ed.) Citation

Janczewski, R., & Turowski, K. (2015). The computational complexity of the backbone coloring problem for bounded-degree graphs with connected backbones. Information processing letters, 115(2), 232-236. https://doi.org/10.1016/j.ipl.2014.09.018

Chicago Style (17th ed.) Citation

Janczewski, Robert, and Krzysztof Turowski. "The Computational Complexity of the Backbone Coloring Problem for Bounded-degree Graphs with Connected Backbones." Information Processing Letters 115, no. 2 (2015): 232-236. https://doi.org/10.1016/j.ipl.2014.09.018.

MLA (9th ed.) Citation

Janczewski, Robert, and Krzysztof Turowski. "The Computational Complexity of the Backbone Coloring Problem for Bounded-degree Graphs with Connected Backbones." Information Processing Letters, vol. 115, no. 2, 2015, pp. 232-236, https://doi.org/10.1016/j.ipl.2014.09.018.