scientific article; zbMATH DE number 1394637
From MaRDI portal
Publication:4934840
DOI<link itemprop=identifier href="https://doi.org/10.1002/(SICI)1520-6610(2000)8:1<42::AID-JCD6>3.0.CO;2-R" /><42::AID-JCD6>3.0.CO;2-R 10.1002/(SICI)1520-6610(2000)8:1<42::AID-JCD6>3.0.CO;2-RzbMath0939.05067MaRDI QIDQ4934840
Publication date: 29 June 2000
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 (22)
\(C_7\)-decompositions of the tensor product of complete graphs ⋮ A note on the Hamilton-Waterloo problem with \(C_8\)-factors and \(C_m\)-factors ⋮ Decompositions of complete symmetric directed graphs into the oriented heptagons ⋮ Constructing uniform 2-factorizations via row-sum matrices: solutions to the Hamilton-Waterloo problem ⋮ Almost resolvable maximum packings of complete graphs with 5-cycles ⋮ On the existence of k $k$‐cycle semiframes for even k $k$ ⋮ On z-cycle factorizations with two associate classes where z is 2a and a is even ⋮ Decomposing complete equipartite graphs into odd square-length cycles: number of parts even ⋮ On the existence of cycle frames and almost resolvable cycle systems ⋮ Completing the spectrum of almost resolvable cycle systems with odd cycle length ⋮ Resolvable gregarious cycle decompositions of complete equipartite graphs ⋮ On the existence of holey 4-cycle frames ⋮ Further results on almost resolvable cycle systems and the Hamilton–Waterloo problem ⋮ On the Hamilton-Waterloo problem with cycle lengths of distinct parities ⋮ Cyclic uniform 2-factorizations of the complete multipartite graph ⋮ More results on cycle frames and almost resolvable cycle systems ⋮ On the Hamilton-Waterloo problem: the case of two cycles sizes of different parity ⋮ Decomposing complete equipartite graphs into short even cycles ⋮ Path and cycle decompositions of complete equipartite graphs: Four parts ⋮ On a generalization of the Oberwolfach problem ⋮ The Hamilton-Waterloo problem with even cycle lengths ⋮ The equipartite Oberwolfach problem with uniform tables
Cites Work
- On a variation of the Oberwolfach problem
- Hamiltonian decomposition of lexicographic product
- The existence of \(C_ k\)-factorizations of \(K_{2n}-F\)
- The solution of the bipartite analogue of the Oberwolfach problem
- The Oberwolfach problem and factors of uniform odd length cycles
- Two new direct product‐type constructions for resolvable group‐divisible designs
This page was built for publication:
