Trying to Prove Kuratowski Theorem from Below
Zeps, Dainis
HAL, hal-00426910 / Harvested from HAL
Text on HAL
This note examines possibility to prove the Kuratowski theorem from below, i.e., assuming that Kuratowski-like theorem for free-planar graphs is right. Version of Kuratowksi theorem for 3-connected components is proved.
Publié le : 2000-01-01
Classification:  Kuratowski theorem,  free-planar graphs,  ACM Graph Theory: G.2.2,  [MATH.MATH-CO]Mathematics [math]/Combinatorics [math.CO] 
@article{hal-00426910,
     author = {Zeps, Dainis},
     title = {Trying to Prove Kuratowski Theorem from Below},
     journal = {HAL},
     volume = {2000},
     number = {0},
     year = {2000},
     language = {en},
     url = {http://dml.mathdoc.fr/item/hal-00426910}
}

Zeps, Dainis. Trying to Prove Kuratowski Theorem from Below. HAL, Tome 2000 (2000) no. 0, . http://gdmltest.u-ga.fr/item/hal-00426910/