Ishii, T., Nagamochi, H., & Ibaraki, T. (2006). Augmenting a (k - 1)-Vertex-Connected Multigraph ℓ-Edge-Connected and k-Vertex-Connected Multigraph. Algorithmica, 44(3), 257-280. https://doi.org/10.1007/s00453-005-1151-4
Citace podle Chicago (17th ed.)Ishii, Toshimasa, Hiroshi Nagamochi, a Toshihide Ibaraki. "Augmenting a (k - 1)-Vertex-Connected Multigraph ℓ-Edge-Connected and K-Vertex-Connected Multigraph." Algorithmica 44, no. 3 (2006): 257-280. https://doi.org/10.1007/s00453-005-1151-4.
Citace podle MLA (9th ed.)Ishii, Toshimasa, et al. "Augmenting a (k - 1)-Vertex-Connected Multigraph ℓ-Edge-Connected and K-Vertex-Connected Multigraph." Algorithmica, vol. 44, no. 3, 2006, pp. 257-280, https://doi.org/10.1007/s00453-005-1151-4.
Upozornění: Tyto citace jsou generovány automaticky. Nemusí být zcela správně podle citačních pravidel..