Journal of Graph Theory · 1985 · 77 citations · 2 references
Natural SciencesMathematicsCombinatoricsNumber TheoryTheory Of ComputationComputational ComplexityGraph AlgorithmsGraph TheoryDecompositionsGraph DecompositionsPolynomial Decomposition
Abstract Some results concerning decompositions of K n , K n ‐ F (where F denotes a 1‐factor) and complements of a family of special cubic graphs into 2‐factors of the same type are given. In particular, if 2d is a divisor of n , it is shown that K n ‐ F can be decomposed into 2‐factors each of whose components is a cycle of length 2d .
2
Some results on the Oberwolfach problem
Pavol Hell, Anton Kotzig, Alexander Rosa · Aequationes Mathematicae · 1975 · 19 citations