Even, G., Garg, N., Könemann, J., Ravi, R., & Sinha, A. (2004). Min–max tree covers of graphs. Operations research letters, 32(4), 309-315. https://doi.org/10.1016/j.orl.2003.11.010
Citace podle Chicago (17th ed.)Even, G., N. Garg, J. Könemann, R. Ravi, a A. Sinha. "Min–max Tree Covers of Graphs." Operations Research Letters 32, no. 4 (2004): 309-315. https://doi.org/10.1016/j.orl.2003.11.010.
Citace podle MLA (9th ed.)Even, G., et al. "Min–max Tree Covers of Graphs." Operations Research Letters, vol. 32, no. 4, 2004, pp. 309-315, https://doi.org/10.1016/j.orl.2003.11.010.
Upozornění: Tyto citace jsou generovány automaticky. Nemusí být zcela správně podle citačních pravidel..