scientific article; zbMATH DE number 6859433
From MaRDI portal
Publication:4634988
zbMath1384.05133MaRDI QIDQ4634988
Selda Küçükçifçi, Emine Şule Yazıcı, Mario Gionfriddo, Salvatore Milici
Publication date: 13 April 2018
Full work available at URL: http://cdm.ucalgary.ca/cdm/index.php/cdm/article/view/564
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) Graph designs and isomorphic decomposition (05C51)
Related Items (1)
Cites Work
- A complete solution to the two-table Oberwolfach problems
- 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
- Balanced and strongly balanced \(P_k\)-designs
- Uniformly resolvable designs with index one, block sizes three and five and up to five parallel classes with blocks of size five
- Complete solutions to the Oberwolfach problem for an infinite set of orders
- Maximum uniformly resolvable designs with block sizes 2 and 4
- Uniformly resolvable pairwise balanced designs with blocksizes two and three
- The solution of the bipartite analogue of the Oberwolfach problem
- On the Hamilton-Waterloo problem
- On \(\lambda\)-fold equipartite Oberwolfach problem with uniform table sizes
- The Oberwolfach problem and factors of uniform odd length cycles
- The equipartite Oberwolfach problem with uniform tables
- The Hamilton-Waterloo problem: the case of Hamilton cycles and triangle-factors
- Maximum uniformly resolvable decompositions of \(K_v\) and \(K_v - I\) into 3-stars and 3-cycles
- On uniformly resolvable designs with block sizes 3 and 4
- On bipartite 2-factorizations of kn − I and the Oberwolfach problem
- The Hamilton-Waterloo problem for cycle sizes 3 and 4
- The Hamilton-Waterloo problem: The case of triangle-factors and one Hamilton cycle
- Bipartite 2‐Factorizations of Complete Multipartite Graphs
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
This page was built for publication:
