R. Krithika 0001, Roohani Sharma, Prafullkumar Tale. The Complexity of Contracting Bipartite Graphs into Small Cycles. In Michael A. Bekos, Michael Kaufmann 0001, editors, Graph-Theoretic Concepts in Computer Science - 48th International Workshop, WG 2022, Tübingen, Germany, June 22-24, 2022, Revised Selected Papers. Volume 13453 of Lecture Notes in Computer Science, pages 356-369, Springer, 2022. [doi]
Abstract is missing.