Journal of applied mathematics & informatics

The Korean Society for Computational and Applied Mathematics (한국전산응용수학회)
권호 표지

5-CYCLABILITY IN INFINITE PLANAR GRAPHS

  • JUNG HWAN-OK (Department of Mathematics, Hanshin University)
  • Published : 2005.09.01

⟨ Previous Next ⟩

Abstract

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.

Keywords