Abstract
Let G be a graph on n ≥ 3 vertices and H be a subgraph of G such that each component of H is a cycle with at most one chord. In this paper we prove that if the minimum degree of G is at least n/2, then G contains a spanning subdivision of H such that only non-chord edges of H are subdivided. This gives a new generalization of the classical result of Dirac on the existence of Hamilton cycles in graphs.
This is a preview of subscription content, log in via an institution to check access.
Similar content being viewed by others
References
Babu C.S., Diwan A.A.: Subdivisions of graphs: a generalization of paths and cycles. Discrete Math. 308, 4479–4486 (2008)
Bondy J.A., Murty U.S.R.: Graph Theory with Applications. Macmillan, New York (1976)
Dirac G.: Some theorems on abstract graphs. Proc. Lond. Math. Soc. 2, 69–81 (1952)
Williamson J.E.: Panconnected graphs II. Period. Math. Hung. 8, 105–116 (1977)
Author information
Authors and Affiliations
Corresponding author
Additional information
Supported by NSFC (Nos. 10871158 and 11001214).
Rights and permissions
About this article
Cite this article
Qiao, S., Zhang, S. Spanning Cyclic Subdivisions of Vertex-Disjoint Cycles and Chorded Cycles in Graphs. Graphs and Combinatorics 28, 277–285 (2012). https://doi.org/10.1007/s00373-011-1042-1
Received:
Revised:
Published:
Issue Date:
DOI: https://doi.org/10.1007/s00373-011-1042-1