Uniformly resolvable decompositions of \(K_v\) into \(P_3\) and \(K_3\) graphs
From MaRDI portal
Publication:397162
DOI10.1016/j.disc.2014.05.010zbMath1296.05166arXiv1312.2113MaRDI QIDQ397162
Publication date: 8 August 2014
Published in: Discrete Mathematics (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/1312.2113
05C38: Paths and cycles
05C70: Edge subsets with special properties (factorization, matching, partitioning, covering and packing, etc.)
05C60: Isomorphism problems in graph theory (reconstruction conjecture, etc.) and homomorphisms (subgraph embedding, etc.)
Related Items
Uniformly resolvable decompositions of \(K_v\) into \(K_2\) and \(K_{1, 3}\) graphs, Resolvable 3-star designs, Maximum uniformly resolvable decompositions of \(K_v\) and \(K_v - I\) into 3-stars and 3-cycles, Uniformly resolvable decompositions of \(K_v\) into paths on two, three and four vertices
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- On the existence of uniformly resolvable decompositions of \(K_v\) and \(K_v-I\) into paths and kites
- Existence of resolvable path designs
- On resolvable mixed path designs
- Uniformly resolvable designs with index one and block sizes three and four - with three or five parallel classes of block size four
- Uniformly resolvable designs with index one, block sizes three and five and up to five parallel classes with blocks of size five
- Maximum uniformly resolvable designs with block sizes 2 and 4
- Resolvable path designs
- Uniformly resolvable pairwise balanced designs with blocksizes two and three
- The Hamilton-Waterloo problem: the case of Hamilton cycles and triangle-factors
- Graph decompositions, handcuffed prisoners and balanced p-designs
- On uniformly resolvable designs with block sizes 3 and 4
- On bipartite 2-factorizations of kn − I and the Oberwolfach problem
- Small Uniformly Resolvable Designs for Block Sizes 3 and 4
