Skip to main content
SpringerLink
Log in

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

  • Conference paper
Combinatorial Geometry and Graph Theory (IJCCGGT 2003)

Part of the book series: Lecture Notes in Computer Science ((LNTCS,volume 3330))

  • 574 Accesses

Abstract

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

This is a preview of subscription content, log in via an institution to check access.

Access this chapter

Log in via an institution
Chapter
USD 29.95
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
eBook
USD 39.99
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD 54.99
Price excludes VAT (USA)
  • Compact, lightweight edition
  • Dispatched in 3 to 5 business days
  • Free shipping worldwide - see info

Tax calculation will be finalised at checkout

Purchases are for personal use only

Institutional subscriptions

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. Heinrich, K., Kobayashi, M., Nakamura, G.: Dudeney’s round table problem. Discrete Mathematics 92, 107–125 (1991)

    Article  MATH  MathSciNet  Google Scholar 

  2. Heinrich, K., Langdeau, D., Verrall, H.: Covering 2-paths uniformly. J. Combin. Des. 8, 100–121 (2000)

    Article  MATH  MathSciNet  Google Scholar 

  3. Heinrich, K., Nonay, G.: Exact coverings of 2-paths by 4-cycles. J. Combin. Theory (A) 45, 50–61 (1987)

    Article  MATH  MathSciNet  Google Scholar 

  4. Kobayashi, M.: Kiyasu, Z. and G. Nakamura, A solution of Dudeney’s round table problem for an even number of people. J. Combinatorial Theory (A) 62, 26–42 (1993)

    Article  Google Scholar 

  5. Kobayashi, M., Nakamura, G.: Uniform coverings of 2-paths by 4-paths. Australasian J. Combin. 24, 301–304 (2001)

    MATH  MathSciNet  Google Scholar 

  6. Kobayashi, M., Nakamura, G., Nara, C.: Uniform coverings of 2-paths with 5-paths in K 2n . Australasian J. Combin. 27, 247–252 (2003)

    MATH  MathSciNet  Google Scholar 

  7. Kobayashi, M., Nakamura, G., Nara, C.: Uniform coverings of 2-paths with 5-paths in the complete graph (accepted)

    Google Scholar 

  8. Kobayashi, M., Nakamura, G.: Uniform coverings of 2-paths with 6-cycles in the complete graph (manuscript)

    Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Research Institute of Educational Development, Tokai University, Shibuya-ku Tokyo, 151-0063, Japan

    Jin Akiyama & Gisaku Nakamura

  2. School of Administration and Informatics, University of Shizuoka, Shizuoka, 422-8526, Japan

    Midori Kobayashi

Authors
  1. Jin Akiyama
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Midori Kobayashi
    View author publications

    You can also search for this author in PubMed Google Scholar

  3. Gisaku Nakamura
    View author publications

    You can also search for this author in PubMed Google Scholar

Editor information

Editors and Affiliations

  1. Research Institute of Education, Tokai University, 2-28-4 Tomigaya, Shibuya-ku, Tokio, Japan

    Jin Akiyama

  2. Department of Mathematics, Institut Teknologi Bandung (ITB), Jalan Ganesa 10 Bandung, P.O. Box, 40132, Indonesia

    Edy Tri Baskoro

  3. Ibaraki University, Nakanarusawa, Hitachi, 316-8511, Ibaraki, Japan

    Mikio Kano

Rights and permissions

Reprints and permissions

Copyright information

© 2005 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

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. IJCCGGT 2003. Lecture Notes in Computer Science, vol 3330. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-540-30540-8_3

Download citation

  • DOI: https://doi.org/10.1007/978-3-540-30540-8_3

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-540-24401-1

  • Online ISBN: 978-3-540-30540-8

  • eBook Packages: Computer ScienceComputer Science (R0)

Publish with us

Policies and ethics

Search

Navigation