Skip to main content
SpringerLink
Log in

Sufficient Condition for {C 4, C 2t } - Decomposition of K 2m,2n – An Improved Bound

  • Conference paper
Combinatorial Algorithms (IWOCA 2012)

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

Included in the following conference series:

Abstract

In this paper, we have improved the bounds of the sufficient conditions obtained by C.C.Chou and C.M.Fu [J. Comb. Optim. 14, 205-218 (2007)] for the existence of decomposition of complete bipartite graph K 2m,2n into cycles of length 4 and 2t, t > 2. Further an algorithm is presented to provide such bound which in turn reduce the number of constructions for the existence of required decomposition.

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. Bondy, J.A., Murty, U.S.R.: Graph theory with applications. The Macmillan Press Ltd., New York (1976)

    MATH  Google Scholar 

  2. Chou, C.C., Fu, C.M., Huang, W.C.: Decomposition of K m,n into short cycles. Discrete Math. 197/198, 195–203 (1999)

    MathSciNet  Google Scholar 

  3. Chou, C.C., Fu, C.M.: Decomposition of K m,n into 4-cycles and 2t-cycles. J. Comb. Optim. 14, 205–218 (2007)

    Article  MathSciNet  MATH  Google Scholar 

  4. Sotteau, D.: Decomposition of \(K_{m,n}(K_{m,n}^{*})\) into cycles (circuits) of length 2k. J. Combin. Theory Ser. B 30, 75–81 (1981)

    Article  MathSciNet  MATH  Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Department of Mathematics, Periyar University, Salem, Tamil Nadu, India

    Shanmugasundaram Jeevadoss & Appu Muthusamy

Authors
  1. Shanmugasundaram Jeevadoss
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Appu Muthusamy
    View author publications

    You can also search for this author in PubMed Google Scholar

Editor information

Editors and Affiliations

  1. Kalasalingam University, Anand Nagar, 626 126, Krishanakoil, Tamil Nadu, India

    S. Arumugam

  2. Algorithms Research Group, Department of Computing & Software, McMaster University, L8S 4K1, Hamilton, ON, Canada

    W. F. Smyth

Rights and permissions

Reprints and permissions

Copyright information

© 2012 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Jeevadoss, S., Muthusamy, A. (2012). Sufficient Condition for {C 4, C 2t } - Decomposition of K 2m,2n – An Improved Bound. In: Arumugam, S., Smyth, W.F. (eds) Combinatorial Algorithms. IWOCA 2012. Lecture Notes in Computer Science, vol 7643. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-642-35926-2_17

Download citation

  • DOI: https://doi.org/10.1007/978-3-642-35926-2_17

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-642-35925-5

  • Online ISBN: 978-3-642-35926-2

  • eBook Packages: Computer ScienceComputer Science (R0)

Publish with us

Policies and ethics

Search

Navigation