Cite
On the chromatic number of P5-free graphs with no large intersecting cliques.
MLA
Xu, Weilun, and Xia Zhang. “On the Chromatic Number of P5-Free Graphs with No Large Intersecting Cliques.” Journal of Combinatorial Optimization, vol. 46, no. 3, Oct. 2023, pp. 1–12. EBSCOhost, https://doi.org/10.1007/s10878-023-01088-5.
APA
Xu, W., & Zhang, X. (2023). On the chromatic number of P5-free graphs with no large intersecting cliques. Journal of Combinatorial Optimization, 46(3), 1–12. https://doi.org/10.1007/s10878-023-01088-5
Chicago
Xu, Weilun, and Xia Zhang. 2023. “On the Chromatic Number of P5-Free Graphs with No Large Intersecting Cliques.” Journal of Combinatorial Optimization 46 (3): 1–12. doi:10.1007/s10878-023-01088-5.