Abstract
A graph G on n vertices is said to be (k, m)-pancyclic if every set of k vertices in G is contained in a cycle of length r for each integer r in the set \(\{ m, m + 1, \ldots , n \}\). This property, which generalizes the notion of a vertex pancyclic graph, was defined by Faudree et al. in (Graphs Combin 20:291–310, 2004). The notion of (k, m)-pancyclicity provides one way to measure the prevalence of cycles in a graph. Broersma and Veldman showed in (Contemporary methods in graph theory, BI-Wiss.-Verlag, Mannheim, Wien, Zürich, pp 181–194, 1990) that any 2-connected claw-free \(P_5\)-free graph must be hamiltonian. In fact, every non-hamiltonian cycle in such a graph is either extendable or very dense. We show that any 2-connected claw-free \(P_5\)-free graph is (k, 3k)-pancyclic for each integer \(k \ge 2\). We also show that such a graph is (1, 5)-pancyclic. Examples are provided which show that these results are best possible. Each example we provide represents an infinite family of graphs.
Similar content being viewed by others
References
Bedrossian, P.: Forbidden subgraph and minimum degree conditions for hamiltonicity. Ph.D. Thesis, Memphis State University (1991)
Bondy, J.A.: Pancyclic graphs, in: Proceedings of the Second Louisiana Conference on Combinatorics, Graph Theory, and Computing, pp. 167–172. Louisiana State University, Baton Rouge (1971)
Bondy, J.A.: Pancyclic graphs I. J. Combin. Theory Ser. B 11, 80–84 (1971)
Broersma, H.J., Veldman, H.J.: Restrictions on induced subgraphs ensuring hamiltonicity or pancyclicity of \(K_{1, 3}\)-free graphs. In: Bodendiek, R. (ed.) Contemporary Methods in Graph Theory, pp. 181–194. BI-Wiss.-Verlag, Mannheim, Wien, Zürich (1990)
Chartrand, G., Lesniak, L., Zhang, P.: Graphs and Digraphs, 5th edn. Chapman and Hall/CRC, Boca Raton (2011)
Crane, C.B.: Generalized pancyclic properties in claw-free graphs. Graphs Comb. (2015). doi:10.1007/s00373-014-1510-5
Faudree, R.J., Gould, R.J.: Characterizing forbidden pairs for Hamiltonian properties. Discrete Math. 173, 45–60 (1997)
Faudree, R.J., Gould, R.J., Jacobson, M.S., Lesniak, L.: Generalizing pancyclic and \(k\)-ordered graphs. Graphs Combin. 20, 291–310 (2004)
Ore, O.: Note on Hamilton circuits. Am. Math. Mon. 67, 55 (1960)
Author information
Authors and Affiliations
Corresponding author
Rights and permissions
About this article
Cite this article
Crane, C.B. Hamiltonian Type Properties in Claw-Free \(P_5\)-Free Graphs. Graphs and Combinatorics 32, 1817–1828 (2016). https://doi.org/10.1007/s00373-016-1680-4
Received:
Revised:
Published:
Issue Date:
DOI: https://doi.org/10.1007/s00373-016-1680-4