Answers are grounded in this paper and cite their sources.
Let G be a graph and let S,T⊆V(G) be two disjoint vertex subsets with S=T=k. A many-to-many k-disjoint path cover of G is a set of k vertex-disjoint paths, each joining a source in S to a sink in T, whose union covers all vertices of G. The cover is paired if each vertex of S must be joined to a prescribed vertex of T, and unpaired otherwise. Let UGn be an n-dimensional Cayley graph generated by a unicyclic graph with bipartition V0 and V1. Let S⊆V0 and T⊆V1 be two vertex subsets with S=T=2. In this paper, we prove that UGn admits an unpaired many-to-many two-disjoint path cover with at most n−3 faulty edges for n≥3.
No takes yet. Share an insight, caveat, or question.
Lin et al. (2026) studied this question.
Synapse has enriched 10 related papers. Consider them for comparative context: