Abidha, V., Ashok, P., Tomar, A., & Yadav, D. (2023). Colouring a dominating set without conflicts: Q-Subset Square Colouring. Theoretical computer science, 976, 114160. https://doi.org/10.1016/j.tcs.2023.114160
Citace podle Chicago (17th ed.)Abidha, V.P, Pradeesha Ashok, Avi Tomar, a Dolly Yadav. "Colouring a Dominating Set Without Conflicts: Q-Subset Square Colouring." Theoretical Computer Science 976 (2023): 114160. https://doi.org/10.1016/j.tcs.2023.114160.
Citace podle MLA (9th ed.)Abidha, V.P, et al. "Colouring a Dominating Set Without Conflicts: Q-Subset Square Colouring." Theoretical Computer Science, vol. 976, 2023, p. 114160, https://doi.org/10.1016/j.tcs.2023.114160.
Upozornění: Tyto citace jsou generovány automaticky. Nemusí být zcela správně podle citačních pravidel..