scientific article; zbMATH DE number 554067
From MaRDI portal
Publication:4288120
zbMath0790.05065MaRDI QIDQ4288120
Publication date: 19 April 1994
Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Paths and cycles (05C38) Edge subsets with special properties (factorization, matching, partitioning, covering and packing, etc.) (05C70)
Related Items (23)
Path decompositions of regular graphs with prescribed girth ⋮ On colored designs. I ⋮ Edge coloring complete uniform hypergraphs with many components ⋮ Multidecompositions of the balanced complete bipartite graph into paths and stars ⋮ 2-regular equicolourings for \(\mathbf P_4\)-designs ⋮ Voloshin's colourings of \(P_{3}\)-designs ⋮ On \(c\)-Bhaskar Rao designs and tight embeddings for path designs ⋮ Packings and coverings of \(\lambda K_{v}\) by \(k\)-circuits with one chord. ⋮ Balanced and strongly balanced \(P_k\)-designs ⋮ Decompositions of complete bipartite graphs and complete graphs into paths, stars, and cycles with four edges each ⋮ Regular path decompositions of odd regular graphs ⋮ Minimal path decomposition of complete bipartite graphs ⋮ Unnamed Item ⋮ Decomposition of \(\lambda K_v\) into five graphs with six vertices and eight edges ⋮ Packing paths in complete graphs ⋮ Decomposition of \(\lambda K_v\) into some graph with six vertices and seven edges ⋮ Graph designs for all graphs with six vertices and eight edges ⋮ The spectrum of \(\text{Meta}(K_3+e> P_4, \lambda)\) and \(\text{Meta}(K_3+e> H_4, \lambda)\) with any \(\lambda \) ⋮ Uniformly resolvable decompositions of \(K_v\) into paths on two, three and four vertices ⋮ Uniformly resolvable \({P_4, C_k}\)-decomposition of \(K_n\) -- a complete solution ⋮ On colored designs. II ⋮ Edge Disjoint Paths of Increasing Order in Complete Bipartite Graphs ⋮ Decompositions of triangle-free 5-regular graphs into paths of length five
This page was built for publication:
