• Search Research Projects
  • Search Researchers
  • How to Use
  1. Back to previous page

MIDORI Kobayashi  小林 みどり

ORCIDConnect your ORCID iD *help
… Alternative Names

KOBAYASHI Midori  小林 みどり

Less
Researcher Number 00136631
Affiliation (based on the past Project Information) *help 2007 – 2010: University of Shizuoka, 経営情報学部, 教授
1999 – 2005: 静岡県立大学, 経営情報学部, 教授
Review Section/Research Field
Principal Investigator
General mathematics (including Probability theory/Statistical mathematics) / General mathematics (including Probability theory/Statistical mathematics)
Keywords
Principal Investigator
Dudeney集合 / uniform covering / Hamilton cycle / neighbor design / Dudeney set / ハミルトンサイクル / 隣接デザイン / Uniform covering / dudeney set / 1-factorization … More / サイクルシステム / 1因子分解 / パス / サイクル / デザイン / グラフ理論 / 2パスデザイン Less
  • Research Projects

    (3 results)
  • Research Products

    (61 results)
  •  Construction of single-path designs and 2-path designsPrincipal Investigator

    • Principal Investigator
      KOBAYASHI Midori (MIDORI Kobayashi)
    • Project Period (FY)
      2007 – 2010
    • Research Category
      Grant-in-Aid for Scientific Research (C)
    • Research Field
      General mathematics (including Probability theory/Statistical mathematics)
    • Research Institution
      University of Shizuoka
  •  cycle design and path designPrincipal Investigator

    • Principal Investigator
      KOBAYASHI Midori
    • Project Period (FY)
      2002 – 2005
    • Research Category
      Grant-in-Aid for Scientific Research (C)
    • Research Field
      General mathematics (including Probability theory/Statistical mathematics)
    • Research Institution
      University of Shizuoka
  •  Neighbour DesignsPrincipal Investigator

    • Principal Investigator
      KOBAYASHI Midori
    • Project Period (FY)
      1999 – 2001
    • Research Category
      Grant-in-Aid for Scientific Research (C)
    • Research Field
      General mathematics (including Probability theory/Statistical mathematics)
    • Research Institution
      University of Shizuoka

All 2010 2009 2008 2006 2005 2004 2003 2002 Other

All Journal Article Presentation

  • [Journal Article] Graceful Labeling of some trees2010

    • Author(s)
      M. Kobayashi, C. Nara, G. Nakamura
    • Journal Title

      Working paper series 2010, School of Administration and Informatics, University of Shizuoka

      Pages: 1-10

    • Data Source
      KAKENHI-PROJECT-19540142
  • [Journal Article] Graceful Labeling of Susuki trees, Working paper series2010

    • Author(s)
      M. Kobayashi, C. Nara, G. Nakamura
    • Journal Title

      School of Administration and Informatics(University of Shizuoka) 1001

      Pages: 1-5

    • Data Source
      KAKENHI-PROJECT-19540142
  • [Journal Article] Uniform coverings of 2-paths with 4-cycles in the complete bipartite graph2010

    • Author(s)
      M. Kobayashi, G. Nakamura
    • Journal Title

      Working paper series, School of Administration and Informatics, University of Shizuoka

      Pages: 1-4

    • Data Source
      KAKENHI-PROJECT-19540142
  • [Journal Article] Black 1-factors and Dudeney sets2010

    • Author(s)
      M. Kobayashi, B. McKay, N. Mutoh, G. Nakamura
    • Journal Title

      Journal of Combinatorial Mathematics and Combinatorial Computing Vol.75

      Pages: 167-174

    • Peer Reviewed
    • Data Source
      KAKENHI-PROJECT-19540142
  • [Journal Article] Black 1-factors and Dudeney sets2010

    • Author(s)
      M.Kobayashi, B.McKay, N.Mutoh, G.Nakamura
    • Journal Title

      Journal of Combinatorial Mathematics and Combinatorial Computing

      Volume: 75 Pages: 167-174

    • Peer Reviewed
    • Data Source
      KAKENHI-PROJECT-19540142
  • [Journal Article] Graceful Labeling of some trees2010

    • Author(s)
      M.Kobayashi, C.Nara, G.Nakamura
    • Journal Title

      Working paper series, School of Administration and Informatics, University of Shizuoka

      Pages: 1-10

    • Data Source
      KAKENHI-PROJECT-19540142
  • [Journal Article] Uniform coverings of 2-paths with 4-cycles in the complete bipartite graph2010

    • Author(s)
      M.Kobayashi, G.Nakamura
    • Journal Title

      Working paper series, School of Administration and Informatics, University of Shizuoka

      Pages: 1-4

    • Data Source
      KAKENHI-PROJECT-19540142
  • [Journal Article] Graceful Labeling of Susuki trees2010

    • Author(s)
      M.Kobayashi, C.Nara, G.Nakamura
    • Journal Title

      Working paper series 1001, School of Administration and Informatics, University of Shizuoka

      Pages: 1-5

    • Data Source
      KAKENHI-PROJECT-19540142
  • [Journal Article] Exact coverings of 2-paths with Hamilton cycles for the complete bipartite graph2010

    • Author(s)
      M. Kobayashi, G. Nakamura
    • Journal Title

      Working paper series, School of Administration and Informatics, University of Shizuoka

      Pages: 1-5

    • Data Source
      KAKENHI-PROJECT-19540142
  • [Journal Article] アダマール行列の一般化とその応用2009

    • Author(s)
      小林, 宮内, 武藤, 中村
    • Journal Title

      経営と情報 第21巻

      Pages: 15-26

    • NAID

      110007172466

    • Data Source
      KAKENHI-PROJECT-19540142
  • [Journal Article] Black 1-factors and Dudeney sets, revised version2009

    • Author(s)
      M. Kobayashi, B. McKay, N. Mutoh, G. Nakamura
    • Journal Title

      Working paper series 0901, School of Administration and Informatics, University of Shizuoka

      Pages: 1-6

    • Data Source
      KAKENHI-PROJECT-19540142
  • [Journal Article] Interlaced Graceful Labeling of Firecrackers, Working paper series2009

    • Author(s)
      M. Kobayashi, C. Nara, G. Nakamura
    • Journal Title

      School of Administration and Informatics(University of Shizuoka) 0902

      Pages: 1-5

    • Data Source
      KAKENHI-PROJECT-19540142
  • [Journal Article] Interlaced Graceful Labeling of Firecrackers2009

    • Author(s)
      M. Kobayashi, C. Nara, G. Nakamura
    • Journal Title

      Working paper series 0902, School of Administration and Informatics, University of Shizuoka

      Pages: 1-5

    • Data Source
      KAKENHI-PROJECT-19540142
  • [Journal Article] Dudeney transformation of normal tiles2008

    • Author(s)
      J. Akiyama, M. Kobayashi, G. Nakamura
    • Journal Title

      Lecture Notes in Computer Science, Springer 4535

      Pages: 1-13

    • Peer Reviewed
    • Data Source
      KAKENHI-PROJECT-19540142
  • [Journal Article] Dudeney transformation of normal tiles, Lecture Notes in Computer Science2008

    • Author(s)
      J. Akiyama, M. Kobayashi, G. Nakamura
    • Journal Title

      Springer 4535

      Pages: 10-13

    • Peer Reviewed
    • Data Source
      KAKENHI-PROJECT-19540142
  • [Journal Article] Semi-Distance Codes and Steiner Systems2008

    • Author(s)
      H. Ito, M. Kobayashi, G. Nakamura
    • Journal Title

      Graphs and Combinatorics 23

      Pages: 283-290

    • Peer Reviewed
    • Data Source
      KAKENHI-PROJECT-19540142
  • [Journal Article] Black 1-factors and Dudeney sets2008

    • Author(s)
      M. Kobayashi, B. McKay, N. Mutoh, G. Nakamura
    • Journal Title

      Working paper series 0801, School of Administration and Informatics, University of Shizuoka.

      Pages: 1-7

    • Data Source
      KAKENHI-PROJECT-19540142
  • [Journal Article] Dudeney transformation of normal tiles2008

    • Author(s)
      J. Akiyama, M. Kobayashi, G. Nakamura
    • Journal Title

      Lecture Notes in Computer Science(Springer) 4535

      Pages: 10-13

    • Peer Reviewed
    • Data Source
      KAKENHI-PROJECT-19540142
  • [Journal Article] Uniform coverings of 2-paths with 6-cycles in the complete graph2006

    • Author(s)
      M.Kobayashi, et al.
    • Journal Title

      Australasian Journal of Combinatorics 34

      Pages: 299-304

    • Description
      「研究成果報告書概要(和文)」より
    • Data Source
      KAKENHI-PROJECT-14540132
  • [Journal Article] Uniform coverings of 2-paths with 6-cycles in the complete graph2006

    • Author(s)
      M.Kobayashi, G.Nakamura
    • Journal Title

      Australasian Journa l of Combinatorics 34

      Pages: 299-304

    • Description
      「研究成果報告書概要(欧文)」より
    • Data Source
      KAKENHI-PROJECT-14540132
  • [Journal Article] Uniform coverings of 2-paths with 5-paths in the complete graph2005

    • Author(s)
      M.Kobayashi, et al.
    • Journal Title

      Discrete Mathematics 299

      Pages: 154-161

    • Description
      「研究成果報告書概要(和文)」より
    • Data Source
      KAKENHI-PROJECT-14540132
  • [Journal Article] Uniform coverings of 2-paths with 5-paths in the complete graph2005

    • Author(s)
      M.Kobayashi, et al.
    • Journal Title

      Discrete Mathematics (in press)

    • Data Source
      KAKENHI-PROJECT-14540132
  • [Journal Article] Uniform coverings of 2-paths with 5-paths in the complete graph2005

    • Author(s)
      M.Kobayashi, G.Nakamura, C.Nara
    • Journal Title

      Discrete Mathematics 299

      Pages: 154-161

    • Description
      「研究成果報告書概要(欧文)」より
    • Data Source
      KAKENHI-PROJECT-14540132
  • [Journal Article] Uniform coverings of 2-paths with 6-paths in the complete graph2005

    • Author(s)
      J.Akiyama, M.Kobayashi, G.Nakamura
    • Journal Title

      Lecture Notes in Computer Science, 3330

      Pages: 25-33

    • Data Source
      KAKENHI-PROJECT-14540132
  • [Journal Article] Uniform coverings of 2-paths with 6-paths in the complete graph2005

    • Author(s)
      J.Akiyama, M.Kobayashi, G.Nakamura
    • Journal Title

      Lecture Notes in Computer Science 3330

      Pages: 25-33

    • Description
      「研究成果報告書概要(和文)」より
    • Data Source
      KAKENHI-PROJECT-14540132
  • [Journal Article] Symmetric Hamilton cycle decompositions of the complete graph2004

    • Author(s)
      J.Akiyama, M.kobayashi, G.Nakamura
    • Journal Title

      Journal of Combinatorial Designs 12

      Pages: 39-45

    • Description
      「研究成果報告書概要(和文)」より
    • Data Source
      KAKENHI-PROJECT-14540132
  • [Journal Article] Double Dudeney sets for p^2 +2 vertices,2003

    • Author(s)
      M.Kobayashi, et al.
    • Journal Title

      経営と情報 15

      Pages: 31-36

    • Description
      「研究成果報告書概要(和文)」より
    • Data Source
      KAKENHI-PROJECT-14540132
  • [Journal Article] Double Dudeney sets for an odd number of vertices2003

    • Author(s)
      M.Kobayashi, et al.
    • Journal Title

      Australasian Journal of Combinatorics 26

      Pages: 65-83

    • Description
      「研究成果報告書概要(和文)」より
    • Data Source
      KAKENHI-PROJECT-14540132
  • [Journal Article] Perfect 1-factorizations of complete bipartite graphs2003

    • Author(s)
      M.Kobayashi, G.Nakamura
    • Journal Title

      経営と情報 15

      Pages: 21-24

    • NAID

      110004614559

    • Description
      「研究成果報告書概要(欧文)」より
    • Data Source
      KAKENHI-PROJECT-14540132
  • [Journal Article] Perfect 1-factorizations of complete bipartite graphs2003

    • Author(s)
      M.Kobayashi, et al.
    • Journal Title

      経営と情報 15

      Pages: 21-24

    • NAID

      110004614559

    • Description
      「研究成果報告書概要(和文)」より
    • Data Source
      KAKENHI-PROJECT-14540132
  • [Journal Article] Uniform coverings of 2-paths with 5-paths in K(2n)2003

    • Author(s)
      M.Kobayashi, et al.
    • Journal Title

      Australasian Journal of Combinatorics 27

      Pages: 247-252

    • Description
      「研究成果報告書概要(和文)」より
    • Data Source
      KAKENHI-PROJECT-14540132
  • [Journal Article] Uniform coverings of 2-paths with 5-paths in K_<2n>2003

    • Author(s)
      M.Kobayashi, N.Mutoh, Z.Kiyasu, G.Nakamura
    • Journal Title

      Australasian Journa l of Combinatorics 27

      Pages: 247-252

    • Description
      「研究成果報告書概要(欧文)」より
    • Data Source
      KAKENHI-PROJECT-14540132
  • [Journal Article] Resolvable coverings of 2-paths by cycles2002

    • Author(s)
      M.Kobayashi, G.Nakamura
    • Journal Title

      Graphs and Combinatorics 18

      Pages: 739-744

    • Description
      「研究成果報告書概要(欧文)」より
    • Data Source
      KAKENHI-PROJECT-14540132
  • [Journal Article] Double Coverings of 2-paths by Hamilton Cycles2002

    • Author(s)
      M.Kobayashi, N.Mutoh, Z.Kiyasu, G.Nakamura
    • Journal Title

      Journal of Combinatorial Designs 10

      Pages: 195-206

    • Description
      「研究成果報告書概要(欧文)」より
    • Data Source
      KAKENHI-PROJECT-14540132
  • [Journal Article] New series of Dudeney sets for p+2 vertices,2002

    • Author(s)
      M.Kobayashi, et al.
    • Journal Title

      Ars Combinatoria 65

      Pages: 3-20

    • Description
      「研究成果報告書概要(和文)」より
    • Data Source
      KAKENHI-PROJECT-14540132
  • [Journal Article] New series of Dudeney sets for p+2 vertices2002

    • Author(s)
      M.Kobayashi, N.Mutoh, Z.Kiyasu, G.Nakamura
    • Journal Title

      Ars Combinatoria 65

      Pages: 3-20

    • Description
      「研究成果報告書概要(欧文)」より
    • Data Source
      KAKENHI-PROJECT-14540132
  • [Journal Article] Multiple Dudeney Sets2002

    • Author(s)
      M.Kobayashi, et al.
    • Journal Title

      経営と情報 14

      Pages: 37-40

    • Description
      「研究成果報告書概要(和文)」より
    • Data Source
      KAKENHI-PROJECT-14540132
  • [Journal Article] Double Coverings of 2-paths by Hamilton Cycles,2002

    • Author(s)
      M.Kobayashi, et al.
    • Journal Title

      Journal of Combinatorial Designs 10

      Pages: 195-206

    • Description
      「研究成果報告書概要(和文)」より
    • Data Source
      KAKENHI-PROJECT-14540132
  • [Journal Article] Resolvable coverings of 2-paths by cycles,2002

    • Author(s)
      M.Kobayashi, G.Nakamura
    • Journal Title

      Graphs and Combinatorics 18

      Pages: 739-744

    • Description
      「研究成果報告書概要(和文)」より
    • Data Source
      KAKENHI-PROJECT-14540132
  • [Journal Article] Multiple Dudeney Sets2002

    • Author(s)
      M.Kobayashi, N.Mutoh, G.Nakamura
    • Journal Title

      経営と情報 14

      Pages: 37-40

    • Description
      「研究成果報告書概要(欧文)」より
    • Data Source
      KAKENHI-PROJECT-14540132
  • [Journal Article] Double Dudeney sets for p^2 + 2 vertices2002

    • Author(s)
      M.Kobayashi, Z.Kiyasu, G.Nakamura
    • Journal Title

      経営と情報 14

      Pages: 31-36

    • Description
      「研究成果報告書概要(欧文)」より
    • Data Source
      KAKENHI-PROJECT-14540132
  • [Journal Article] Double Dudeney sets for an odd number of vertices2002

    • Author(s)
      M.Kobayashi, N.Mutoh, Z.Kiyasu, G.Nakamura
    • Journal Title

      Australasian Journal of Combinatorics 26

      Pages: 65-83

    • Description
      「研究成果報告書概要(欧文)」より
    • Data Source
      KAKENHI-PROJECT-14540132
  • [Journal Article] Black 1-factors and Dudeney sets

    • Author(s)
      M. Kobayashi, B. McKay, N. Mutoh, G. Nakamura
    • Journal Title

      Ars Combinatoria (印刷中)

    • Peer Reviewed
    • Data Source
      KAKENHI-PROJECT-19540142
  • [Journal Article] Black 1-factors and Dudeney sets

    • Author(s)
      M.Kobayashi, B.McKay, N.Mutoh, G.Nakamura
    • Journal Title

      Ars Combinatoria (印刷中)

    • Peer Reviewed
    • Data Source
      KAKENHI-PROJECT-19540142
  • [Journal Article] Uniform coverings of 2-paths with 6-cycles in the complete graph

    • Author(s)
      M.Kobayashi, et al.
    • Journal Title

      Australasian Journal of Combinatorics (in press)

    • Data Source
      KAKENHI-PROJECT-14540132
  • [Journal Article] Arrangements of n points whose incident-line-numbers are at most n/2 the JCCGG2009 special issue of Graphs and Combinatorics (G&C)

    • Author(s)
      J. Akiyama, H. Ito, M. Kobayashi, G. Nakamura
    • Journal Title

      Springer, accepted

    • Peer Reviewed
    • Data Source
      KAKENHI-PROJECT-19540142
  • [Journal Article] Dudeney transformation of normal tiles

    • Author(s)
      J. Akiyama, M. Kobayashi, G. Nakamura
    • Journal Title

      Lecture Notes in Computer Science, Springer (印刷中)

    • Peer Reviewed
    • Data Source
      KAKENHI-PROJECT-19540142
  • [Presentation] Magic squares with powered sum the China-Japan Joint Conference on Computational Geometry2010

    • Author(s)
      S. Chikaraishi, M. Kobayashi, N. Mutoh, G. Nakamura
    • Organizer
      Graphs and Applications
    • Place of Presentation
      大連, 中国
    • Year and Date
      2010-11-06
    • Data Source
      KAKENHI-PROJECT-19540142
  • [Presentation] Exact coverings of 2-paths with 4-cycles in the complete, bipartite graph2010

    • Author(s)
      M. Kobayashi, G. Nakamura
    • Organizer
      the 54th Annual Meeting of the Australian Mathematical Society
    • Place of Presentation
      Brisbane, Australia
    • Year and Date
      2010-09-29
    • Data Source
      KAKENHI-PROJECT-19540142
  • [Presentation] Exact coverings of 2-paths with 4-cycles in the complete bipartite graph2010

    • Author(s)
      M.Kobayashi, G.Nakamura
    • Organizer
      the 54th Annual Meeting of the Australian Mathematical Society
    • Place of Presentation
      Brisbane, Australia
    • Year and Date
      2010-09-29
    • Data Source
      KAKENHI-PROJECT-19540142
  • [Presentation] Magic squares with powered sum2010

    • Author(s)
      S.Chikaraishi, M.Kobayashi, N.Mutoh, G.Nakamura
    • Organizer
      the China-Japan Joint Conference on Computational Geometry, Graphs and Applications
    • Place of Presentation
      大連,中国
    • Year and Date
      2010-11-06
    • Data Source
      KAKENHI-PROJECT-19540142
  • [Presentation] Arrangements of n points whose incident-line-numbers are at most n/22009

    • Author(s)
      H.Ito, M.Kobayashi, G.Nakamura
    • Organizer
      Japan Conference on Computational Geometry and Graphs
    • Place of Presentation
      金沢市
    • Year and Date
      2009-11-11
    • Data Source
      KAKENHI-PROJECT-19540142
  • [Presentation] Arrangements of eleven points in the plane, each with five incident lines2009

    • Author(s)
      H. Ito, M. Kobayashi, G. Nakamura
    • Organizer
      Japan Conference on Computational Geometry and Graphs
    • Place of Presentation
      Kanazawa, Japan
    • Data Source
      KAKENHI-PROJECT-19540142
  • [Presentation] Arrangements of eleven points in the plane, each with five incident lines2009

    • Author(s)
      H.Ito, M.Kobayashi, G.Nakamura
    • Organizer
      Japan Conference on Computational Geometry and Graphs
    • Place of Presentation
      金沢市
    • Year and Date
      2009-11-11
    • Data Source
      KAKENHI-PROJECT-19540142
  • [Presentation] Nakamura, Arrangements of eleven points in the plane, each with five incident lines2009

    • Author(s)
      H. Ito, M. Kobayashi
    • Organizer
      Japan Conference on Computational Geometry and Graphs
    • Place of Presentation
      Kanazawa, Japan
    • Data Source
      KAKENHI-PROJECT-19540142
  • [Presentation] Arrangements of n points whose incident-line-numbers are at most n/22009

    • Author(s)
      H. Ito, M. Kobayashi, G. Nakamura
    • Organizer
      Japan Conference on Computational Geometry and Graphs
    • Place of Presentation
      Kanazawa, Japan
    • Data Source
      KAKENHI-PROJECT-19540142
  • [Presentation] Dudeney transformation of normal tiles2008

    • Author(s)
      J. Akiyama, M. Kobayashi, G. Nakamura
    • Organizer
      General topologyシンポジウム
    • Place of Presentation
      高崎
    • Data Source
      KAKENHI-PROJECT-19540142
  • [Presentation] アダマール行列の一般化とその応用2008

    • Author(s)
      小林みどり, 宮内美樹, 武藤伸明, 中村義作
    • Organizer
      離散数学の統計科学および関連分野への応用研究集会
    • Place of Presentation
      岐阜県下呂市
    • Data Source
      KAKENHI-PROJECT-19540142
  • [Presentation] Dudeney transformation of normal tiles2008

    • Author(s)
      Akiyama, M. Kobayashi, G. Nakamura
    • Organizer
      General topology シンポジウム
    • Place of Presentation
      高崎経済大学
    • Data Source
      KAKENHI-PROJECT-19540142
  • [Presentation] Dudeney transformation of normal tiles2008

    • Author(s)
      J. Akiyama, M. Kobayashi, G. Nakamura
    • Organizer
      The Kyoto International Conference on Computational Geometry and Graph Theory
    • Place of Presentation
      京都大学
    • Year and Date
      2008-06-14
    • Data Source
      KAKENHI-PROJECT-19540142
  • [Presentation] アダマール行列の一般化2008

    • Author(s)
      小林, 宮内, 中村
    • Organizer
      離散数学の統計科学および関連分野への応用研究集会
    • Place of Presentation
      岐阜県下呂市
    • Data Source
      KAKENHI-PROJECT-19540142

URL: 

Are you sure that you want to link your ORCID iD to your KAKEN Researcher profile?
* This action can be performed only by the researcher himself/herself who is listed on the KAKEN Researcher’s page. Are you sure that this KAKEN Researcher’s page is your page?

この研究者とORCID iDの連携を行いますか?
※ この処理は、研究者本人だけが実行できます。

Information User Guide FAQ News Terms of Use Attribution of KAKENHI

Powered by NII kakenhi