Ključne besede: graph planarity, planarity testing, Boyer–Myrvold algorithm, Kuratowski/Wagner theorem, depth-first search (DFS), lowpoint values, articulation points, biconnected components, graph embedding, graph6 formatObjavljeno v RUP: 04.10.2025; Ogledov: 1036; Prenosov: 20 Celotno besedilo (1,69 MB)
Ključne besede: graph search, search tree, polynomial-time algorithms, BFS, DFSObjavljeno v RUP: 02.10.2020; Ogledov: 4766; Prenosov: 50 Celotno besedilo (618,54 KB)
