Skip to main content
SpringerLink
Log in

A Note on Edge-Disjoint Hamilton Cycles in Line Graphs

  • Original Paper
  • Published:
Graphs and Combinatorics Aims and scope Submit manuscript

Abstract

It is well known that if a graph G contains a spanning closed trail, then its line graph L(G) is Hamiltonian. In this note, it is proved that if a graph G with minimum degree at least 4k has k edge-disjoint spanning closed trails, then L(G) contains k edge-disjoint Hamilton cycles.

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

Access this article

Log in via an institution

Price excludes VAT (USA)
Tax calculation will be finalised during checkout.

Instant access to the full article PDF.

Institutional subscriptions

Similar content being viewed by others

References

  1. Alspach, B., Bermond, J.-C., Sotteau, D.: Decomposition into cycles I: Hamilton decompositions. In: Hahn, G., et al. (eds.) Cycles and rays, pp. 9–18. Norwell, MA (1990)

    Chapter  Google Scholar 

  2. Bondy, J.A., Murty, U.S.R.: Graph theory with applications. American Elsevier, New York (1976)

    Book  MATH  Google Scholar 

  3. Harary, S.L., Nash-Williams, CStJA: On eulerian and hamiltonian grahs and line graphs. Can. Math. Bull. 8, 701–710 (1965)

    Article  MathSciNet  MATH  Google Scholar 

  4. Jaeger, F.: A note on subeulerian graphs. J. Graph Theory 3, 91–93 (1979)

    Article  MathSciNet  MATH  Google Scholar 

  5. Kundu, S.: Bounds on the number of edge-disjoint spanning trees. J. Combin Theory 7, 199–203 (1974)

    Article  Google Scholar 

  6. Lai, H.-J.: Every 4-connected line graph of a planar graph is hamiltonian. Graphs Combin 10, 249–253 (1994)

    Article  MathSciNet  MATH  Google Scholar 

  7. Lai, H.-J., Shao, Y., Zhan, M.: Every 4-connected line graph of a quasi claw-free graph is hamiltonian connected. Discrete Math 308, 5312–5316 (2008)

    Article  MathSciNet  MATH  Google Scholar 

  8. Lai, H.-J., Shao, Y., Wu, H., Zhou, J.: Every 3-connected, essentially 11-connected line graph is Hamiltonian. J. Combin. Theory Ser. B 96, 571–576 (2006)

    Article  MathSciNet  MATH  Google Scholar 

  9. Lai, H.-J., Xiong, L., Yan, H., Yan, J.: Every 3-connected claw-free \(Z_8\)-free graph is Hamiltonian. J. Graph Theory 64, 1–11 (2010)

    Article  MathSciNet  MATH  Google Scholar 

  10. Lai, H.-J., Shao, Y., Yu, G., Zhan, M.: Hamiltonian connectedness in 3-connected line graphs. Discrete Appl. Math. 157(5), 982–990 (2009)

    Article  MathSciNet  MATH  Google Scholar 

  11. Nash-Williams, CStJA: Edge-disjoint spanning trees of finite graphs. J. London Mtah. Soc. 36, 445–450 (1961)

    Article  MathSciNet  MATH  Google Scholar 

  12. Ryjáček, Z.: On a closure concept in claw-free graphs. J. Combin. Theory Ser. B 70, 217–224 (1997)

    Article  MathSciNet  MATH  Google Scholar 

  13. Ryjáček, Z., Vrána, P.: Line graphs of multigraphs and Hamilton-connectedness of claw-free graphs. J. Graph Theory 66, 152–173 (2011)

    Article  MathSciNet  MATH  Google Scholar 

  14. Tutte, W.T.: On the problem of decomposing a graph into \(n\) connected factors. J. London Math. Soc. 36, 221–230 (1961)

    Article  MathSciNet  MATH  Google Scholar 

Download references

Acknowledgments

The authors thank the referees for their valuable comments that improved the presentation.

Author information

Authors and Affiliations

  1. Laboratoire de Recherche en Informatique, UMR 8623, C.N.R.S.-Université Paris-sud, 91405, Orsay cedex, France

    Hao Li, Weihua He & Yandong Bai

  2. Institute for Interdisciplinary Research, Jianghan University, Wuhan, China

    Hao Li

  3. Department of Applied Mathematics, Guangdong University of Technology, Guangzhou, China

    Weihua He

  4. Departement of Mathematics, Taiyuan University of Technology, Taiyuan, China

    Weihua Yang

Authors
  1. Hao Li
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Weihua He
    View author publications

    You can also search for this author in PubMed Google Scholar

  3. Weihua Yang
    View author publications

    You can also search for this author in PubMed Google Scholar

  4. Yandong Bai
    View author publications

    You can also search for this author in PubMed Google Scholar

Corresponding author

Correspondence to Weihua He.

Rights and permissions

Reprints and permissions

About this article

Check for updates. Verify currency and authenticity via CrossMark

Cite this article

Li, H., He, W., Yang, W. et al. A Note on Edge-Disjoint Hamilton Cycles in Line Graphs. Graphs and Combinatorics 32, 741–744 (2016). https://doi.org/10.1007/s00373-015-1606-6

Download citation

  • Received:

  • Revised:

  • Published:

  • Issue Date:

  • DOI: https://doi.org/10.1007/s00373-015-1606-6

Keywords

Search

Navigation