Near 2-factorizations of 2K n : Cycles of even length-Reference-Cited by-同舟云学术

Near 2-factorizations of 2K n : Cycles of even length

Published:1989-12 Issue:1 Volume:5 Page:213-221
ISSN:0911-0119
Container-title:Graphs and Combinatorics
language:en
Short-container-title:Graphs and Combinatorics

Author:

Burling James,Heinrich Katherine

Publisher

Springer Science and Business Media LLC

Subject

Discrete Mathematics and Combinatorics,Theoretical Computer Science

Link

http://link.springer.com/content/pdf/10.1007/BF01788673.pdf

Reference10 articles.

1. Alspach, B., Häggkvist, R.: Some observations on the Oberwolfach problem. J. Graph Theory9, 177–187 (1985)

2. Alspach, B., Schellenberg, P., Stinson, D., Wagner, D.: The Oberwolfach problem and factors of uniform odd length cycles. Research Report No. 86-04, Dept. of Math. and Stats. Simon Fraser University.

3. Bennett, F.E.: Conjugate orthogonal latin squares and Mendelsohn designs. Ars Comb.15, 51–62 (1985)

4. Bennett, F.E., Sotteau, D.: Almost resolvable decompositions ofK n * . J. Comb. Theory (B)30, 228–232 (1981)

5. Hanani, H.: On resolvable balanced incomplete block designs. J. Comb. Theory (A)17, 275–289 (1974)

Cited by 9 articles. 订阅此论文施引文献订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献

1. Further results on almost resolvable cycle systems and the Hamilton-Waterloo problem;Journal of Combinatorial Designs;2017-09-07

2. Note on three table Oberwolfach problem;Electronic Notes in Discrete Mathematics;2016-09

3. A Complete Solution to the Existence of (k,λ)-Cycle Frames of Type gu;Journal of Combinatorial Designs;2016-05-30

4. Equitable block-colorings of C4-decompositions of Kv−F;Discrete Mathematics;2016-05

5. 4-Cycle Systems of $$K_n - E(F^*)$$ K n - E ( F ∗ );Graphs and Combinatorics;2014-06-10