\(C_ k\)-factorization of complete bipartite graphs

DOI10.1007/BF01864159zbMath0673.05071OpenAlexW1968986283MaRDI QIDQ1120596

Kazuhiko Ushio, Hikoe Enomoto, Takashi Miyamoto

Publication date: 1988

Published in: Graphs and Combinatorics (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/bf01864159

zbMATH Keywords

C(k)-factorization

Mathematics Subject Classification ID

Edge subsets with special properties (factorization, matching, partitioning, covering and packing, etc.) (05C70)

Related Items (6)

\(C_{4p}\)-frame of complete multipartite multigraphs ⋮ Star-factorization of symmetric complete bipartite digraphs ⋮ \(G\)-designs and related designs ⋮ Unnamed Item ⋮ \(\widehat S_k\)-factorization of symmetric complete tripartite digraphs ⋮ Cycle-factorization of symmetric complete multipartite digraphs

Cites Work

• Unnamed Item
• Decomposition of K//(m,n)(K*//(m,n)) into cycles (circuits) of length 2k

This page was built for publication: \(C_ k\)-factorization of complete bipartite graphs