Journal of applied mathematics & informatics

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

[2,3]-FACTORS IN A 3-CONNECTED INFINITE PLANAR GRAPH

  • Published : 2002.09.01

⟨ Previous Next ⟩

Abstract

For two integers m, n with m $\leq$ n, an [m,n]-factor F in a graph G is a spanning subgraph of G with m $\leq$ d$\_$F/(v) $\leq$ n for all v ∈ V(F). In 1996, H. Enomoto et al. proved that every 3-connected Planar graph G with d$\_$G/(v) $\geq$ 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.

Keywords

References

  1. Canad. J. Math. v.18 Trees in polyhedral graphs D. W. Barnette
  2. Graph Theory with Applications J. A. Bondy;U. S. R. Murty
  3. J. Graph Th. v.23 Spanning paths in infinite planar graphs N. Dean;R. Thomas;X. Yu
  4. J. Comb. Th. v.(B)68 Connected spanning subgraphs of 3-connected planar graphs H. Enomoto;T. Iida;K. Ota
  5. J. Graph Th. v.20 2-connected coverings of bounded degree in 3-connected graphs Z. Gao
  6. J. Comb. Th. v.(B)62 2-Walks in circuit graphs Z. Gao;B. Richter
  7. Australasian J. Combin. v.2 k-walks of graphs B. Jackson;N. C. Wormald
  8. Abh. Math. Sem. Univ. Hamburg v.64 One-way infinite hamiltonian paths in infinite maximal planar graphs H. O. Jung
  9. Comm. Korean Math. Soc. v.11 On spanning 3-trees in infinite 3-connected planar graphs H. O. Jung
  10. Korean J. Comp. & Appl. Math v.4 On the Tightedness Conditions for Maximal Planar Graphs H. O. Jung
  11. J. Comb. Th. v.(B)29 Planarity and duality of finite and infinite graphs C. Thomassen