1 |
H. Bruhn and R. Diestel, Duality in infinite graphs, Combinatoric, Probability and Computing 15 (2006), 75-90.
DOI
|
2 |
R. Diestel, Graph Theory (2nd Ed.), Springer-Verlag, New York, 2000.
|
3 |
H. Jung, On spanning 3-trees in infinite 3-connected planar graphs, Comm. Korean Math. Soc. 11 (1996), 1-21.
|
4 |
H. Jung, Structural properties for certain classes of infinite planar graphs, J. Appl. Math. & Computing 13 (2003),105-115.
DOI
|
5 |
H. Jung, Some problems and results on circuit graphs and triangular graphs, J. Appl. Math. & Computing 26 (2008), 531-540.
|
6 |
D. P. Sanders, On Hamiltonian cycles in certain planar graphs, J. Graph Th. 21 (1996), 43-50.
DOI
|
7 |
N. Polat, Ends and multi-endings, J. Comb. Th. (B) 67 (1996), 86-110.
DOI
|
8 |
R. Schmidt, Ein Ordnungsbegriff fur Graphen ohne unendliche Wege mit einer Anwendung auf n-fach zusammenhangende Graphen, Arch. Math. 40 (1983), 283-288.
DOI
|
9 |
P.D. Seymour and R. Thomas, Excluding infinite trees, Trans. Amer. Math. Soc. 335 (1993), 597-630.
DOI
|
10 |
C. Thomassen, Straight line representations of infinite planar graphs, J. London Math. Soc. 16 (1977), 411-423.
|
11 |
C. Thomassen, Duality of infinite graphs, J. Comb. Th. (B) 33 (1982), 137-160.
DOI
|