Janczewski, R., & Turowski, K. (2015). The computational complexity of the backbone coloring problem for planar graphs with connected backbones. Discrete Applied Mathematics, 184, 237-242. https://doi.org/10.1016/j.dam.2014.10.028
Citace podle Chicago (17th ed.)Janczewski, Robert, a Krzysztof Turowski. "The Computational Complexity of the Backbone Coloring Problem for Planar Graphs with Connected Backbones." Discrete Applied Mathematics 184 (2015): 237-242. https://doi.org/10.1016/j.dam.2014.10.028.
Citace podle MLA (9th ed.)Janczewski, Robert, a Krzysztof Turowski. "The Computational Complexity of the Backbone Coloring Problem for Planar Graphs with Connected Backbones." Discrete Applied Mathematics, vol. 184, 2015, pp. 237-242, https://doi.org/10.1016/j.dam.2014.10.028.