APA (7th ed.) Citation

Das, S., & Mishra, S. (2022). On the complexity of minimum q-domination partization problems. Journal of Combinatorial Optimization, 43(2), 363-383. https://doi.org/10.1007/s10878-021-00779-1

Chicago Style (17th ed.) Citation

Das, Sayani, and Sounaka Mishra. "On the Complexity of Minimum Q-domination Partization Problems." Journal of Combinatorial Optimization 43, no. 2 (2022): 363-383. https://doi.org/10.1007/s10878-021-00779-1.

MLA (9th ed.) Citation

Das, Sayani, and Sounaka Mishra. "On the Complexity of Minimum Q-domination Partization Problems." Journal of Combinatorial Optimization, vol. 43, no. 2, 2022, pp. 363-383, https://doi.org/10.1007/s10878-021-00779-1.