Maximum cliques in a graph without disjoint given subgraph.

MLA

Zhang, Fangfang, et al. “Maximum Cliques in a Graph without Disjoint given Subgraph.” Discrete Mathematics, vol. 347, no. 4, Apr. 2024, p. N.PAG. EBSCOhost, https://doi.org/10.1016/j.disc.2023.113863.

APA

Zhang, F., Chen, Y., Győri, E., & Zhu, X. (2024). Maximum cliques in a graph without disjoint given subgraph. Discrete Mathematics, 347(4), N.PAG. https://doi.org/10.1016/j.disc.2023.113863

Chicago

Zhang, Fangfang, Yaojun Chen, Ervin Győri, and Xiutao Zhu. 2024. “Maximum Cliques in a Graph without Disjoint given Subgraph.” Discrete Mathematics 347 (4): N.PAG. doi:10.1016/j.disc.2023.113863.