Cite
FOUR-COLORING P6-FREE GRAPHS. II. FINDING AN EXCELLENT PRECOLORING.
MLA
Chudnovsky, Maria, et al. “Four-Coloring P6-Free Graphs. Ii. Finding an Excellent Precoloring.” SIAM Journal on Computing, vol. 53, no. 1, Jan. 2024, pp. 146–87. EBSCOhost, https://doi.org/10.1137/18M1234849.
APA
Chudnovsky, M., Spirkl, S., & Zhong, M. (2024). Four-Coloring P6-Free Graphs. Ii. Finding an Excellent Precoloring. SIAM Journal on Computing, 53(1), 146–187. https://doi.org/10.1137/18M1234849
Chicago
Chudnovsky, Maria, Sophie Spirkl, and Mingxian Zhong. 2024. “Four-Coloring P6-Free Graphs. Ii. Finding an Excellent Precoloring.” SIAM Journal on Computing 53 (1): 146–87. doi:10.1137/18M1234849.