Cite
Complexity of paired domination in AT-free and planar graphs.
MLA
Tripathi, Vikash, et al. “Complexity of Paired Domination in AT-Free and Planar Graphs.” Theoretical Computer Science, vol. 930, Sept. 2022, pp. 53–62. EBSCOhost, https://doi.org/10.1016/j.tcs.2022.07.010.
APA
Tripathi, V., Kloks, T., Pandey, A., Paul, K., & Wang, H.-L. (2022). Complexity of paired domination in AT-free and planar graphs. Theoretical Computer Science, 930, 53–62. https://doi.org/10.1016/j.tcs.2022.07.010
Chicago
Tripathi, Vikash, Ton Kloks, Arti Pandey, Kaustav Paul, and Hung-Lung Wang. 2022. “Complexity of Paired Domination in AT-Free and Planar Graphs.” Theoretical Computer Science 930 (September): 53–62. doi:10.1016/j.tcs.2022.07.010.