Abstract
In this article we give several definitions of connectedness and extendability of paths and cycles in directed graphs. We define sets of digraphs by various types of connectedness or extendability and give some containments as well as give examples to show proper containment.
This is a preview of subscription content, log in via an institution to check access.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Similar content being viewed by others
References
Alavi, Y., Williamson, J. E., “Panconnected graphs”, Studia Scientiarum Mathematicarum Hungarica, 10 (1975) Nos. 1–2: 19–22.
Arangno, D. C., “Hamiltonicity, Pancyclicity, and Cycle Extendability in Graphs”, Utah State University (2014). All Graduate Theses and Dissertations. 3295. https://digitalcommons.usu.edu/etd/3295
Beasley, L. B. and Brown, D. E., “On cycle and bi-cycle extendability in chordal and chordal bipartite graphs”, Congressus Numerantium. 174(2005)41–47.
Beasley, L. B. and Brown, D. E., “Cycle extendability in graphs and digraphs”. Linear Algebra Appl. 435 (2011), no. 7, 1513–1519.
Beasley, L. B., Merz, S. K., Brown, D. E., and Thomas, B. J., “Cycle extendability in tournamendts”. Congressus Numerantium. 233 (2019), pp.95-101.
Chartrand, G. and Lesniak, L., Graphs and Digraphs, \(2^{nd}\)Ed., Wadswoth & Brooks/Cole, Monterey, CA, 1986
G. Chen, R.J. Faudree, R.J. Gould, M.S. Jacobson, “Cycle extendability of Hamiltonian interval graphs”, SIAM J. Discrete Math. 20(3) (2006) 682–689.
Hendry, G.R.T., “Extending Cycles in Directed Graphs”, J. Comb. Th. B., 46(1989) 162–172.
Hendry, G. R. T., “Extending cycles in graphs”, Discrete Math. 85 (1990) no. 1, 59 – 72.
Hendry, G. R. T., “Path extendable graphs”, Per. Math. Hungarica, 21(3, (1990), 205 – 219.
Lafond, M. and Seamone, B., “Hamiltonian chordal graphs are not cycle extendible”, SIAM J. Discrete Math. 29(2), (2015) 877–887.
J. W. Moon, Topics in Tournaments, Holt, New York, 1968.
J. W. Moon, “On cycles in Tournaments”, Matematicky Časopsis, 19(1969, No. 2, 121–125.
Zhang, Z.-B., Zhang, X., Broersma, H., and Lou, D., “Extremal and degree conditions for path extendability in digraphs”. SIAM J. Discrete Math. 31 (2017), no. 3, 1990–2014.
Author information
Authors and Affiliations
Corresponding author
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2022 The Author(s), under exclusive license to Springer Nature Switzerland AG
About this paper
Cite this paper
Beasley, L.B. (2022). Connectivity and Extendability in Digraphs. In: Hoffman, F. (eds) Combinatorics, Graph Theory and Computing. SEICCGTC 2020. Springer Proceedings in Mathematics & Statistics, vol 388. Springer, Cham. https://doi.org/10.1007/978-3-031-05375-7_19
Download citation
DOI: https://doi.org/10.1007/978-3-031-05375-7_19
Published:
Publisher Name: Springer, Cham
Print ISBN: 978-3-031-05374-0
Online ISBN: 978-3-031-05375-7
eBook Packages: Mathematics and StatisticsMathematics and Statistics (R0)