Journal of applied mathematics & informatics
- 제19권1_2호
- /
- Pages.537-543
- /
- 2005
- /
- 2734-1194(pISSN)
- /
- 2234-8417(eISSN)
5-CYCLABILITY IN INFINITE PLANAR GRAPHS
초록
A graph is k-cyclable if given k vertices there is a cycle that contains the k vertices. Sallee showed that every finite 3-connected planar graph is 5-cyclable. In this paper Sallee's result is extended to 3-connected infinite locally finite VAP-free plane graphs containing no unbounded faces.