Paired (n-1)-to-(n-1) disjoint path covers in bipartite transposition-like graphs

MaRDI QIDQ6522282arXivFDO

Authors Anna Coleman, Gabrielle Fischberg, Charles Gong, Joshua Harrington, Tony W. H. Wong

Mathematics Subject Classification ID

Eulerian and Hamiltonian graphs (05C45) Edge subsets with special properties (factorization, matching, partitioning, covering and packing, etc.) (05C70) Structural characterization of families of graphs (05C75)

This page was built for publication: Paired $(n-1)$-to-$(n-1)$ disjoint path covers in bipartite transposition-like graphs

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6522282)