Abstract
A graph isk-cyclable if givenk vertices there is a cycle that contains thek vertices. Sallee showed that every finite 3-connected planar graph is 5-cyclable. In this paper, by characterizing the circuit graphs and investigating the structure of LV-graphs, we extend his result to 3-connected infinite locally finite VAP-free plane graphs.
Similar content being viewed by others
References
R. Diestel,Graph Theory (3rd Ed.), Springer-Verlag, Heidelberg, 2005.
G. A. Dirac,In abstrakten Graphen vorhandene vollständige 4-Graphen und ihre Unterteilungen, Math. Nachr. 22 (1960), 61–85.
W. Erling and L. Yanpei,Weak embeddings of planar graphs, J. Appl. Math. & Computing 21 (2006), 175–187.
H. O. Jung,Structural properties for certain classes of infinite planar graphs, J. Appl. Math. & Computing 13 (2003), 105–115.
H. O. Jung,5-cyclability in infinite planar graphs, J. Appl. Math. & Computing 19 (2005), 537–543.
K. Kawarabayashi,A theorem on paths in locally planar triangulations, Europ. J. Comb. 25 (2004), 781–784.
V. Klee,A property of polyhedral graphs, J. Math. Mech. 13 (1964), 1039–1042.
F. Laviolette,Decompositions of infinite graphs: I—bond-faithful decompositions, J. Comb. Th. (B) 94 (2005), 259–277.
G. T. Sallee,Circuits and paths through specified nodes, J. Comb. Th. (B) 15 (1973), 32–39.
M. E. Watkin, D. M. Mesner,Cycles and connectivity in graphs, Canad. J. Math. 19 (1967), 1319–1328.
X. Yu,Infinite paths in planar graphs III, 1-way infinite paths, J. Graph Th. 51 (2006), 175–198.
Author information
Authors and Affiliations
Corresponding author
Additional information
This Work is Supported by Hanshin University Research Grants 2006.
Rights and permissions
About this article
Cite this article
Jung, HO. An extension of Sallee’s theorem to infinite locally finite vap-free plane graphs. J. Appl. Math. Comput. 22, 83–93 (2006). https://doi.org/10.1007/BF02896462
Received:
Issue Date:
DOI: https://doi.org/10.1007/BF02896462