Acknowledgement
Supported by : Hanshin University
References
- D.W. Barnette, Trees in polyhedral graphs, Canad. J. Math. 18 (1966), 731-736. https://doi.org/10.4153/CJM-1966-073-4
- H. Bruhn, The cycle space of a 3-connected locally finite graph is generated by its finite and infinite peripheral circuits, J. Comb. Th. (B) 92 (2004), 235-256. https://doi.org/10.1016/j.jctb.2004.03.005
- R. Diestel, Graph Theory (3nd Ed.), Springer-Verlag, Heidelberg, 2005.
- R. Diestel, On spanning trees and k-connectedness in infinite graphs, J. Comb. Th. (B) 56 (1992), 263-277. https://doi.org/10.1016/0095-8956(92)90022-P
- Z. Gao & R. B. Richter, 2-walks in circuit graphs, J. Comb. Th, (B) 62 (1994), 259-267. https://doi.org/10.1006/jctb.1994.1068
- H. Jung, On spanning 3-trees in infinite 3-connected planar graphs, Comm. Korean Math. Soc. 11 (1996), 1-21.
- H. Jung, Some problems and results on circuit graphs and triangular graphs, J. Appl. Math. & Informatics 26 (2008), 531-540.
- H. Jung, A structural theorem and a classification of an infinite locally finite planar graph, J. Appl, Math. & Informatics 27 (2009), 531-539.
- H. Jung, Spanning 3-forests in bridges of a tight semiring in an LV-graph, J. Appl. Math. & Informatics 27 (2009), 1307-1318.
- J. Siran, End-faithful forests and spanning trees in infinite graphs, Disc. Math. 95 (1991), 331-340. https://doi.org/10.1016/0012-365X(91)90345-3