Does an algorithm exist that finds a vertex-disjoint set of 6-cycles on a bipartite graph that covers one of the partite sets or determines that one does not exist?
I've found some papers on related subjects, specifically Disjoint Small Cycles in Graphs and Bipartite Graphs (Ma, Gao 2013), which gives conditions for being able to decompose bipartite graphs into disjoint 6-cycles and 6-paths or quadrilaterals, but I haven't found a useful algorithm for checking if a disjoint 6-cycle cover exists. Does anyone know if such an algorithm exists?
Thank you.