2,3]-factors in a 3-connected infinite planar graph

Abstract

For two integers m,n with m ≤ n, an [m, n]-factor F in a graph G is a spanning subgraph of G with m ≤ dF(v) ≤ n for all v ∈ V(F). In 1996, H. Enomoto et al. proved that every 3-connected planar graph G with dG(v) ≥ 4 for all v ∈ V(G) contains a [2,3]-factor. In this paper we extend their result to all 3-connected locally finite infinite planar graphs containing no unbounded faces.