• 제목/요약/키워드: hanmiltonian paths

검색결과 1건 처리시간 0.016초

ON THE TIGHTNESS CONDITIONS FOR MAXIMAL PLANAR GRAPHS

  • HWAN-OK JUNG
    • Journal of applied mathematics & informatics
    • /
    • 제4권1호
    • /
    • pp.235-242
    • /
    • 1997
  • 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.