Esther Galby, Paloma T. Lima, Andrea Munaro, Amir Nikabadi. Maximum List r-Colorable Induced Subgraphs in $$kP_3$$-Free Graphs. // Algorithmica. – 2026. – DOI: 10.1007/s00453-026-01410-7. – URL: https://doi.org/10.1007/s00453-026-01410-7
Esther Galby, Paloma T. Lima, Andrea Munaro, & Amir Nikabadi (2026). Maximum List r-Colorable Induced Subgraphs in $$kP_3$$-Free Graphs. Algorithmica. https://doi.org/10.1007/s00453-026-01410-7
Esther Galby, et al. “Maximum List r-Colorable Induced Subgraphs in $$kP_3$$-Free Graphs.” Algorithmica, 2026. doi:10.1007/s00453-026-01410-7.
@article{Galby2026,
title = {Maximum List r-Colorable Induced Subgraphs in \$\$kP\_3\$\$-Free Graphs},
author = {Galby, Esther and Lima, Paloma T. and Munaro, Andrea and Nikabadi, Amir},
journal = {Algorithmica},
year = {2026},
doi = {10.1007/s00453-026-01410-7},
url = {https://doi.org/10.1007/s00453-026-01410-7}
}