Exact coverings of 2-paths by Hamilton cycles ハミルトン閉路による2通路の完全被覆問題

Search this Article

Author

    • 小林, みどり, 1951- コバヤシ, ミドリ

Bibliographic Information

Title

Exact coverings of 2-paths by Hamilton cycles

Other Title

ハミルトン閉路による2通路の完全被覆問題

Author

小林, みどり, 1951-

Author(Another name)

コバヤシ, ミドリ

University

慶應義塾大学

Types of degree

理学博士

Grant ID

乙第2377号

Degree year

1991-07-03

Note and Description

博士論文

Table of Contents

  1. 論文目録 / (0001.jp2)
  2. Contents / p5 (0011.jp2)
  3. 1 Introduction / p1 (0013.jp2)
  4. 2 A Dudeney set in[数式]when n=[数式]+1 / p6 (0018.jp2)
  5. 2.1 Introduction / p6 (0018.jp2)
  6. 2.2 Preliminaries / p6 (0018.jp2)
  7. 2.3 Exchanging edges / p8 (0020.jp2)
  8. 2.4 Hamiltonicity of[数式] / p13 (0025.jp2)
  9. 2.5 Construction of a Dudeney set in[数式] / p15 (0027.jp2)
  10. 2.6 Determination of[数式]when n=pq+1 / p18 (0030.jp2)
  11. 2.7 Determination of[数式]when n=[数式]+1 / p21 (0033.jp2)
  12. 2.8 Determination of[数式]when n=[数式]+1 / p22 (0034.jp2)
  13. 3 A Dudeney set in[数式]when n is even / p27 (0039.jp2)
  14. 3.1 Introduction / p27 (0039.jp2)
  15. 3.2 Preliminaries / p27 (0039.jp2)
  16. 3.3 Definition of 1-factors in[数式] / p29 (0041.jp2)
  17. 3.4 Exchanging edges / p38 (0050.jp2)
  18. 3.5 Recursive construction of a Dudeney set / p42 (0054.jp2)
  19. 4 Perfect 1-factorizations of the complete graph / p62 (0074.jp2)
  20. 4.1 Introduction / p62 (0074.jp2)
  21. 4.2 Semi-regular 1-factorizations / p63 (0075.jp2)
  22. 4.3 Perfect 1-factorizations / p67 (0079.jp2)
  23. 5 Exact coverings of 2-paths by cycles / p68 (0080.jp2)
  24. 5.1 Introduction / p68 (0080.jp2)
  25. 5.2 A C(2m,4,1)design / p70 (0082.jp2)
  26. 5.3 A resolvable C(4k,4,1)design / p74 (0086.jp2)
  27. 5.4 A near-resolvable C(4k+2,4,1)design / p75 (0087.jp2)
  28. Bibliography / p77 (0089.jp2)
3access

Codes

  • NII Article ID (NAID)
    500000082512
  • NII Author ID (NRID)
    • 8000001002837
  • DOI(NDL)
  • NDLBibID
    • 000000246826
  • Source
    • NDL ONLINE
    • NDL Digital Collections
Page Top