Premium
Spanning paths in infinite planar graphs
Author(s) -
Dean Nathaniel,
Thomas Robin,
Yu Xingxing
Publication year - 1996
Publication title -
journal of graph theory
Language(s) - English
Resource type - Journals
SCImago Journal Rank - 1.164
H-Index - 54
eISSN - 1097-0118
pISSN - 0364-9024
DOI - 10.1002/(sici)1097-0118(199610)23:2<163::aid-jgt7>3.0.co;2-r
Subject(s) - combinatorics , mathematics , planar graph , conjecture , discrete mathematics , graph , path (computing) , computer science , programming language
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. © 1996 John Wiley & Sons, Inc.