Schmid, Andreas Algorithms and Complexity, MPI for Informatics, Max Planck Society;
arXiv:1804.03485.pdf (Preprint), 3MB
Chalermsook, P., Schmid, A., & Uniyal, S. (2018). A Tight Extremal Bound on the Lovász Cactus Number in Planar Graphs. Retrieved from http://arxiv.org/abs/1804.03485.