• DocumentCode
    1195376
  • Title

    On maximal planarization of nonplanar graphs

  • Author

    Thulasiraman, K. ; Jayakumar, R. ; Swamy, M.N.S.

  • Volume
    33
  • Issue
    8
  • fYear
    1986
  • fDate
    8/1/1986 12:00:00 AM
  • Firstpage
    843
  • Lastpage
    844
  • Abstract
    In this paper, we first point out that the planarization algorithm due to Ozawa and Takahashi [4] does not in general produce a maximal planar subgraph when applied on a nonplanar graph. However, we prove that the algorithm produces a maximal planar subgraph in the case of a complete graph.
  • Keywords
    Graph theory; Circuits; Planarization; Testing; Tree graphs;
  • fLanguage
    English
  • Journal_Title
    Circuits and Systems, IEEE Transactions on
  • Publisher
    ieee
  • ISSN
    0098-4094
  • Type

    jour

  • DOI
    10.1109/TCS.1986.1085997
  • Filename
    1085997
    • Link To Document
    https://search.isc.ac/dl/search/defaultta.aspx?DTC=49&DC=1195376