P\({}_ 3\)-factorization of complete multipartite graphs
From MaRDI portal
Publication:920114
DOI10.1007/BF01788695zbMath0708.05046MaRDI QIDQ920114
Publication date: 1989
Published in: Graphs and Combinatorics (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/bf01788695
complete multipartite graph; spanning subgraph; \(P_ 3\)-factorization; edge-disjoint sum; H-factorization
05C70: Edge subsets with special properties (factorization, matching, partitioning, covering and packing, etc.)
Related Items
P3-factorization of triangulated Cartesian product of complete graphs, Unnamed Item, \(\widehat S_k\)-factorization of symmetric complete tripartite digraphs, Path factorizations of complete multipartite graphs, Cycle-factorization of symmetric complete multipartite digraphs, On path factorizations of complete multipartite graphs, 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
Cites Work