Journal of applied mathematics & informatics

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

ON THE TIGHTNESS CONDITIONS FOR MAXIMAL PLANAR GRAPHS

  • Published : 1997.03.01

⟨ Previous Next ⟩

Abstract

We characterize the tight structure of a vertex-accumula-tion-free maximal planar graph with no separating triangles. Together with the result of Halin who gave an equivalent form for such graphs this yields that a tight structure always exists in every 4-connected maximal planar graph with one end.

Keywords

References

  1. Graph Theory with Applications J. A. Bondy;U. S. R. Murty
  2. J. Graph Th. v.14 Hamiltonian cycles in planar triangulations with no separating triangles M. B. Dillencourt
  3. Ann. Disc. Math. v.41 Some problems and results on infinite graphs R. Halin
  4. J. Korean Math. Soc. v.30 Hamiltonian paths in infinite strong triangulations H. O. Jung
  5. J. Graph Th. v.21 On Hamilton cycles in certain planar graphs D. P. Sanders
  6. J. London Math. Soc. v.16 Straight line representations of infinite planar graphs C. Thomassen
  7. Ann. Math. v.32 A theorem on graphs H. Whitney