Abstract
Earlier results originating from Bedrossian’s PhD Thesis focus on characterizing pairs of forbidden subgraphs that imply hamiltonian properties. Instead of forbidding certain induced subgraphs, here we relax the requirements by imposing Ore-type degree conditions on the induced subgraphs. In particular, adopting the terminology introduced by Čada, for a graph \(G\) on \(n\) vertices and a fixed graph \(H\), we say that \(G\) is \(H\)-\(o_1\)-heavy if every induced subgraph of \(G\) isomorphic to \(H\) contains two nonadjacent vertices with degree sum at least \(n+1\) in \(G\). For a family \({\mathcal {H}}\) of graphs, \(G\) is called \({\mathcal {H}}\)-\(o_{1}\)-heavy if \(G\) is \(H\)-\(o_1\)-heavy for every \(H\in \mathcal {H}\). In this paper we characterize all connected graphs \(R\) and \(S\) other than \(P_3\) (the path on three vertices) such that every 2-connected \(\{R,S\}\)-\(o_1\)-heavy graph is either a cycle or pancyclic, thereby extending previous results on forbidden subgraph conditions for pancyclicity and on heavy subgraph conditions for hamiltonicity.
Similar content being viewed by others
References
Bedrossian, P.: Forbidden subgraph and minimum degree conditions for hamiltonicity, Ph.D. Thesis, Memphis State University, USA (1991)
Bedrossian, P., Chen, G., Schelp, R.H.: A generalization of Fan’s condition for hamiltonicity, pancyclicity, and hamiltonian connectedness. Discrete Math. 115, 39–50 (1993)
Benhocine, A., Wojda, A.P.: The Geng-Hua Fan conditions for pancyclic or Hamilton-connected graphs. J. Combin. Theory B 42, 167–180 (1987)
Bondy, J.A., Murty, U.S.R.: Graph Theory. In: Springer Graduate Texts in Mathematics, vol. 244. Springer, Berlin (2008)
Broersma, H.J., Ryjáček, Z., Schiermeyer, I.: Dirac’s minimum degree condition restricted to claws. Discrete Math. 167(168), 155–166 (1997)
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.-Verl, Mannheim-Wien-Zfirich (1990)
Čada, R.: Degree conditions on induced claws. Discrete Math. 308, 5622–5631 (2008)
Li, B., Ryjáček, Z., Wang, Y., Zhang, S.: Pairs of heavy subgraphs for Hamiltonicity of 2-connected graphs (2011). eprint arXiv:1109.4122
Ore, O.: Note on hamiltonian circuits. Am. Math. Mon. 67, 55 (1960)
Author information
Authors and Affiliations
Corresponding author
Additional information
This research was supported by NSFC (No. 11271300) and the Doctorate Foundation of Northwestern Polytechnical University (No. cx201202 and No. cx201326). B. Li and S. Zhang were also supported by NSFC (No. 10871158 and 11171273).
Rights and permissions
About this article
Cite this article
Li, B., Ning, B., Broersma, H. et al. Characterizing Heavy Subgraph Pairs for Pancyclicity. Graphs and Combinatorics 31, 649–667 (2015). https://doi.org/10.1007/s00373-014-1406-4
Received:
Published:
Issue Date:
DOI: https://doi.org/10.1007/s00373-014-1406-4