Uniform Coverings of 2-Paths with 6-Paths in the Complete Graph

  • Jin Akiyama
  • Midori Kobayashi
  • Gisaku Nakamura
Conference paper

DOI: 10.1007/978-3-540-30540-8_3

Part of the Lecture Notes in Computer Science book series (LNCS, volume 3330)
Cite this paper as:
Akiyama J., Kobayashi M., Nakamura G. (2005) Uniform Coverings of 2-Paths with 6-Paths in the Complete Graph. In: Akiyama J., Baskoro E.T., Kano M. (eds) Combinatorial Geometry and Graph Theory. Lecture Notes in Computer Science, vol 3330. Springer, Berlin, Heidelberg

Abstract

Let n ≥ 7. Then there exists a uniform covering of 2-paths with 6-paths in Kn if and only if n ≡ 0,1,2 (mod 5).

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

Copyright information

© Springer-Verlag Berlin Heidelberg 2005

Authors and Affiliations

  • Jin Akiyama
    • 1
  • Midori Kobayashi
    • 2
  • Gisaku Nakamura
    • 1
  1. 1.Research Institute of Educational DevelopmentTokai UniversityShibuya-ku TokyoJapan
  2. 2.School of Administration and InformaticsUniversity of ShizuokaShizuokaJapan

Personalised recommendations