Trying to Prove Kuratowski Theorem from Below

Dainis Zeps (1)

1 IMCS - Institute of Mathematics and Computer Science

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.

Mots clés: Kuratowski theorem; free-planar graphs

Domaines: Combinatoire [math.CO]

Dainis Zeps. Trying to Prove Kuratowski Theorem from Below. 2000. ⟨hal-00426910⟩