scientific article; zbMATH DE number 7198014
From MaRDI portal
Publication:5109050
zbMath1439.05189MaRDI QIDQ5109050
Antoinette Tripodi, Melissa S. Keranen, Donald L. Kreher, Salvatore Milici
Publication date: 7 May 2020
Full work available at URL: http://ajc.maths.uq.edu.au/pdf/76/ajc_v76_p055.pdf
Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Edge subsets with special properties (factorization, matching, partitioning, covering and packing, etc.) (05C70) Connectivity (05C40) Isomorphism problems in graph theory (reconstruction conjecture, etc.) and homomorphisms (subgraph embedding, etc.) (05C60)
Related Items (3)
Cites Work
- Uniformly resolvable decompositions of \(K_v\) into \(K_2\) and \(K_{1, 3}\) graphs
- On the existence of uniformly resolvable decompositions of \(K_v\) and \(K_v-I\) into paths and kites
- Uniformly resolvable decompositions of \(K_v\) into \(P_3\) and \(K_3\) graphs
- Resolvable 3-star designs
- Uniformly resolvable designs with block sizes 3 and 4
- Maximum uniformly resolvable designs with block sizes 2 and 4
- Uniformly resolvable pairwise balanced designs with blocksizes two and three
- On decomposition of r-partite graphs into edge-disjoint Hamilton circuits
- The Oberwolfach problem and factors of uniform odd length cycles
- The equipartite Oberwolfach problem with uniform tables
- 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
- On uniformly resolvable designs with block sizes 3 and 4
- Some observations on the oberwolfach problem
- On tree factorizations of Kn
- Resolvable balanced incomplete block designs with block size 5
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
This page was built for publication:
