A Kuratowski-type theorem for planarity of partially embedded graphs
Authors:
- Vít JelínekVJVít Jelínek
- Jan KratochvílJKJan Kratochvíl
- Ignaz RutterIRIgnaz Rutter
- 1 May 2013
- journal article
- Published by Elsevier in Computational Geometry
- Vol. 46 (4) , 466-492
Abstract
No abstract availableAll Related Versions
This publication has 10 references indexed in Scilit:
- Intersection Graphs in Simultaneous Embedding with Fixed EdgesJournal of Graph Algorithms and Applications, 2009
- 2-restricted extensions of partial embeddings of graphsEuropean Journal of Combinatorics, 2005
- A Survey on Contractible Edges in Graphs of a Prescribed Vertex ConnectivityGraphs and Combinatorics, 2002
- Contractible Subgraphs in 3-Connected GraphsJournal of Combinatorial Theory, Series B, 2000
- On-Line Planarity TestingSIAM Journal on Computing, 1996
- On-Line Maintenance of Triconnected Components with SPQR-TreesAlgorithmica, 1996
- Removable edges in 3-connected graphsJournal of Graph Theory, 1990
- Über eine Eigenschaft der ebenen KomplexeMathematische Annalen, 1937
- Congruent Graphs and the Connectivity of GraphsAmerican Journal of Mathematics, 1932
- Sur le problème des courbes gauches en TopologieFundamenta Mathematicae, 1930