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: 326; Prenosov: 0
Ključne besede: graph search methods, breadth first search, depth first searchObjavljeno v RUP: 18.10.2021; Ogledov: 2804; Prenosov: 25 Povezava na celotno besedilo
Ključne besede: graph search methods, breadth first search, depth first searchObjavljeno v RUP: 18.10.2021; Ogledov: 3678; Prenosov: 27 Povezava na celotno besedilo
