Publication | Closed Access
Some observations on the oberwolfach problem
76
Citations
2
References
1985
Year
Mathematical ProgrammingGeometry Of NumberCombinatorics On WordOberwolfach ProblemEngineeringGraph TheoryGeometric Graph TheoryAlgebraic Graph TheoryStructural Graph TheoryTopological Graph TheoryExtremal Graph TheoryK NExtremal CombinatoricsDiscrete MathematicsCombinatorial OptimizationSpecial Cubic GraphsLength 2D
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 .
| Year | Citations | |
|---|---|---|
Page 1
Page 1