Skip to main content
SpringerLink
Log in

Hamiltonian Connectedness in Claw-Free Graphs

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

Abstract

If every vertex cut of a graph G contains a locally 2-connected vertex, then G is quasilocally 2-connected. In this paper, we prove that every connected quasilocally 2-connected claw-free graph is Hamilton-connected.

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. Asratian A.S.: Every 3-connected locally connected claw-free graph is Hamilton-connected. J. Graph Theory 23, 191–201 (1996)

    Article  MathSciNet  MATH  Google Scholar 

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

    Google Scholar 

  3. Broersma H.J., Veldman H.J.: 3-connected line graphs of triangular graphs are panconnected and 1-hamiltonian. J. Graph Theory 11, 399–407 (1987)

    Article  MathSciNet  MATH  Google Scholar 

  4. Chartrand G., Gould R.J., Polimeni A.D.: A note on locally connected and Hamilton-connected graphs. Israel J. Math 33, 5–8 (1979)

    Article  MathSciNet  MATH  Google Scholar 

  5. Clark L.: Hamiltonian properties of connected, locally connected graphs. Congr. Numer. 32, 199–204 (1981)

    MathSciNet  Google Scholar 

  6. Kanetkar S.V., Rao P.R.: Connected locally 2-connected K 1,3-free graphs are panconnected. J. Graph Theory 8, 347–353 (1984)

    Article  MathSciNet  MATH  Google Scholar 

  7. Sheng Y., Tian F., Wei B.: Panconnectivity of locally connected claw-free graphs. Discrete. Math 203, 253–260 (1999)

    Article  MathSciNet  MATH  Google Scholar 

  8. Zhang C.Q.: Cycles of given length in some K 1,3-free graphs. Discrete. Math 78, 307–313 (1989)

    Article  MathSciNet  MATH  Google Scholar 

Download references

Author information

Authors and Affiliations

  1. School of Software, Dalian University of Technology, Dalian, 116620, People’s Republic of China

    Xiaodong Chen, Mingchu Li & Xinxin Fan

  2. Department of mathematics of Shenyang Jianzhu, University Urban Construction College, Shenyang, 110167, People’s Republic of China

    Xin Ma

Authors
  1. Xiaodong Chen
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Mingchu Li
    View author publications

    You can also search for this author in PubMed Google Scholar

  3. Xin Ma
    View author publications

    You can also search for this author in PubMed Google Scholar

  4. Xinxin Fan
    View author publications

    You can also search for this author in PubMed Google Scholar

Corresponding author

Correspondence to Xiaodong Chen.

Additional information

Contract grant sponsor: Nature Science Foundation of China; Contract grant numbers: 60673046; 60805024; 90715037; Contract grant sponsor: SRFDP; Contract grant number: 200801410028; Contract grant sponsor: CSTC; Contract grant number: 2007BA2024; Contract grant sponsor: Fundamental Research Funds for the Central Universities; Contract grant number: DUT10ZD110.

Rights and permissions

Reprints and permissions

About this article

Cite this article

Chen, X., Li, M., Ma, X. et al. Hamiltonian Connectedness in Claw-Free Graphs. Graphs and Combinatorics 29, 1259–1267 (2013). https://doi.org/10.1007/s00373-012-1210-y

Download citation

  • Received:

  • Revised:

  • Published:

  • Issue Date:

  • DOI: https://doi.org/10.1007/s00373-012-1210-y

Keywords

Mathematics Subject Classification (2000)

Search

Navigation