Lu, C., Wang, B., & Wang, K. (2018). Algorithm complexity of neighborhood total domination and (ρ,γnt)-graphs. Journal of combinatorial optimization, 35(2), 424-435. https://doi.org/10.1007/s10878-017-0181-6
Citace podle Chicago (17th ed.)Lu, Changhong, Bing Wang, a Kan Wang. "Algorithm Complexity of Neighborhood Total Domination and (ρ,γnt)-graphs." Journal of Combinatorial Optimization 35, no. 2 (2018): 424-435. https://doi.org/10.1007/s10878-017-0181-6.
Citace podle MLA (9th ed.)Lu, Changhong, et al. "Algorithm Complexity of Neighborhood Total Domination and (ρ,γnt)-graphs." Journal of Combinatorial Optimization, vol. 35, no. 2, 2018, pp. 424-435, https://doi.org/10.1007/s10878-017-0181-6.
Upozornění: Tyto citace jsou generovány automaticky. Nemusí být zcela správně podle citačních pravidel..