Keywords: graph planarity, planarity testing, Boyer–Myrvold algorithm, Kuratowski/Wagner theorem, depth-first search (DFS), lowpoint values, articulation points, biconnected components, graph embedding, graph6 formatPublished in RUP: 04.10.2025; Views: 354; Downloads: 0
Keywords: graph search, search tree, polynomial-time algorithms, BFS, DFSPublished in RUP: 02.10.2020; Views: 3826; Downloads: 28 Link to full text