P\({}_ 3\)-factorization of complete multipartite graphs

DOI10.1007/BF01788695zbMath0708.05046OpenAlexW1972324219MaRDI QIDQ920114

Kazuhiko Ushio, Reiji Tsuruno

Publication date: 1989

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

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

zbMATH Keywords

complete multipartite graphspanning subgraph\(P_ 3\)-factorizationedge-disjoint sumH-factorization

Mathematics Subject Classification ID

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

Related Items

Star-factorization of symmetric complete bipartite digraphs, \(P_{5}\)-factorization of complete bipartite graphs, Uniformly resolvable decompositions of \(K_v\) into paths on two, three and four vertices, Unnamed Item, \(\widehat S_k\)-factorization of symmetric complete tripartite digraphs, P₃-factorization of triangulated Cartesian product of complete graphs, Path factorizations of complete multipartite graphs, Cycle-factorization of symmetric complete multipartite digraphs, On path factorizations of complete multipartite graphs

Cites Work

• Resolvable path designs
• \(P_ 3\)-factorization of complete bipartite graphs
• Unnamed Item