论文信息 - Spanning paths in infinite planar graphs

Spanning paths in infinite planar graphs

Let G be a 4-connected infinite planar graph such that the deletion of any finite set of vertices of G results in at most one infinite component. We prove a conjecture of Nash-Williams that G has a 1-way infinite spanning path. c © 1996 John Wiley

Robin Thomas | Xingxing Yu | Nathaniel Dean

[1] Carsten Thomassen,et al. A theorem on paths in planar graphs , 1983, J. Graph Theory.

[2] Frank Plumpton Ramsey,et al. On a Problem of Formal Logic , 1930 .

[3] H. O. Jung. One-way infinite hamiltonian paths in infinite maximal planar graphs , 1994 .

[4] W. T. Tutte. A THEOREM ON PLANAR GRAPHS , 1956 .

[5] Xingxing Yu,et al. 4-Connected Projective-Planar Graphs Are Hamiltonian , 1994, J. Comb. Theory, Ser. B.