Skip to main content
SpringerLink
Log in

A Note on Degree Conditions for Traceability in Locally Claw-Free Graphs

  • Published:
Mathematics in Computer Science Aims and scope Submit manuscript

Abstract

We say that a set S of vertices is traceable in a graph G whenever there is a path in G containing all vertices of S. In this paper we study the problem of traceability of a prescribed set of vertices in a locally claw-free graph (i.e. a graph in which some specified vertices are not centers of an induced claw). In particular we give sufficient degree conditions restricted to the given set S of vertices for the traceability of S.

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. Broersma H.J.: Sufficient conditions for hamiltonicity and traceability in K(1,3)-graphs. In: Hamiltonian cycles in graphs and related topics, Ph.D. Thesis, pp. 45–53. University of Twente (1988)

  2. Čada R.: The *-closure for graphs and claw-free graphs. Discret. Math. 308(23), 5585–5596 (2008)

    Article  MATH  Google Scholar 

  3. Čada R., Flandrin E., Li H., Ryjáček Z.: Cycles through given vertices and closures. Discret. Math. 276, 65–80 (2004)

    Article  MATH  Google Scholar 

  4. Dirac GA.: Some theorems on abstract graphs. Proc. Lond. Math. Soc. 2, 69–81 (1952)

    Article  MathSciNet  MATH  Google Scholar 

  5. Fronček D., Ryjáček Z., Skupień Z.: On traceability and 2-factors in claw-free graphs. Discuss. Math. Graph Theory 24, 55–71 (2004)

    MathSciNet  MATH  Google Scholar 

  6. Frydrych W., Skupień Z.: Non-traceability of large connected claw-free graphs. J. Graph Theory 27(2), 75–86 (1998)

    Article  MathSciNet  MATH  Google Scholar 

  7. Kovářík O., Mulač M., Ryjáček Z.: A note on degree conditions for hamiltonicity in 2-connected claw-free graphs. Discret. Math. 244(1–3), 253–268 (2002)

    MATH  Google Scholar 

  8. Ryjáček Z.: On a closure concept for claw-free graphs. JCTB 70(2), 217–224 (1997)

    Article  MATH  Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Department of Mathematics, University of West Bohemia, Pilsen, Czech Republic

    Roman Čada

  2. Institute for Theoretical Computer Science, Charles University, Pilsen, Czech Republic

    Roman Čada

  3. L.R.I., Université Paris-Sud, Orsay, France

    Evelyne Flandrin & Haiyan Kang

  4. School of Mathematics, Shandong University, Jinan, Shandong, China

    Haiyan Kang

Authors
  1. Roman Čada
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Evelyne Flandrin
    View author publications

    You can also search for this author in PubMed Google Scholar

  3. Haiyan Kang
    View author publications

    You can also search for this author in PubMed Google Scholar

Corresponding author

Correspondence to Roman Čada.

Additional information

Research of the first author was partially supported by grant No. 1M0021620808 of the Czech Ministry of Education. The work on this paper was partly done during author’s stay at L.R.I., Orsay, France.

Rights and permissions

Reprints and permissions

About this article

Cite this article

Čada, R., Flandrin, E. & Kang, H. A Note on Degree Conditions for Traceability in Locally Claw-Free Graphs. Math.Comput.Sci. 5, 21–25 (2011). https://doi.org/10.1007/s11786-011-0074-5

Download citation

  • Received:

  • Revised:

  • Accepted:

  • Published:

  • Issue Date:

  • DOI: https://doi.org/10.1007/s11786-011-0074-5

Keywords

Mathematics Subject Classification (2010)

Search

Navigation