scientific article

From MaRDI portal
Publication:3698826

zbMath0577.05045MaRDI QIDQ3698826

Roland Haeggkvist

Publication date: 1985


Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.



Related Items (30)

On the Oberwolfach problem for single-flip 2-factors via graceful labelingsDecompositions of complete graphs into bipartite 2-regular subgraphsInfinitely many cyclic solutions to the Hamilton-Waterloo problem with odd length cyclesOn bipartite 2-factorizations of kn − I and the Oberwolfach problemThe Hamilton-Waterloo problem with 4-cycles and a single factor of \(n\)-cyclesNote on three table Oberwolfach problemSome observations on the oberwolfach problemDecomposing the complete graph and the complete graph minus a 1-factor into copies of a graph \(G\) where \(G\) is the union of two disjoint cyclesA complete solution to the two-table Oberwolfach problemsOrthogonally Resolvable Cycle DecompositionsResolvable cycle decompositions of complete multigraphs and complete equipartite multigraphs via layering and detachmentUniformly resolvable cycle decompositions with four different factorsA complete solution to the infinite Oberwolfach problemAn asymptotic solution to the cycle decomposition problem for complete graphsA brief review on Egmont Köhler's mathematical workThe solution of the bipartite analogue of the Oberwolfach problemThe Hamilton-Waterloo problem with \(C_4\) and \(C_m\) factorsPacking cycles in complete graphs2‐Starters, Graceful Labelings, and a Doubling Construction for the Oberwolfach ProblemOn the Hamilton-Waterloo problem with cycle lengths of distinct paritiesOn the Hamilton‐Waterloo Problem for Bipartite 2‐FactorsDecompositions of complete graphs into blown-up cycles \(C_m\)[2] ⋮ Zero-sum flows for triple systemsCycle decompositions of complete multigraphsBipartite 2‐Factorizations of Complete Multipartite GraphsThe Hamilton-Waterloo problem with even cycle lengthsComplete solutions to the Oberwolfach problem for an infinite set of ordersCycle decompositions of \(K_n\) and \(K_n-I\)The structure of 2-pyramidal 2-factorizationsFactorizations of complete graphs into cycles and 1-factors




This page was built for publication: