2009/09/02 by Dainis Zeps, Zeps, Dainis
Computer Science · Mathematics · #ACM Graph Theory: G.2.2 #Advanced Graph Theory Research #Combinatorics (math.CO) #Complexity and Algorithms in Graphs #FOS: Mathematics #Limits and Structures in Graph Theory #math.CO #msc:G.2.2
paper · pdf · doi:10.48550/arxiv.0909.0328
preprint in KAM Series DIMATIA, 98-409, Prague, 1998, 10 pp
arxiv created 2009/09/02 · openalex publication_date 2009/09/02 · arxiv updated 2009/12/01 · openalex created_date 2025/10/10 · openalex updated_date 2026/07/28
Free-minor closed classes [2] and free-planar graphs [3] are considered. Versions of Kuratowski-like theorem for free-planar graphs and Kuratowski theorem for planar graphs are considered.