Ključne besede: simplicial vertex, avoidable vertex, maximum weight clique problem, polynomial-time algorithm, hole-cyclically orientable graphObjavljeno v RUP: 03.09.2019; Ogledov: 1738; Prenosov: 16 Povezava na celotno besedilo
Ključne besede: simplicial vertex, avoidable vertex, avoidable edge, avoidable path, maximum weight clique problem, polynomial-time algorithm, hole-cyclically orientable graphObjavljeno v RUP: 20.08.2019; Ogledov: 2067; Prenosov: 156 Povezava na celotno besedilo
Ključne besede: odd action automorphism, even action automorphism, automorphism group, vertex-transitive graph, orientable-regular mapObjavljeno v RUP: 18.07.2018; Ogledov: 2994; Prenosov: 127 Povezava na celotno besedilo
Ključne besede: 1-perfectly orientable graph, K4-minor-free graph, outerplanar graphObjavljeno v RUP: 24.01.2018; Ogledov: 3101; Prenosov: 133 Povezava na celotno besedilo
Ključne besede: 1-perfectly orientable graph, structural characterization of families of graphs, chordal graph, interval graph, circular arc graph, cograph, block-cactus graph, cobipartite graph, K4-minor-free graph, outerplanar graph, graph product, Cartesian product, lexicographic product, direct product, strong product, price of connectivity, cycle transversal, path transversalObjavljeno v RUP: 09.11.2017; Ogledov: 2623; Prenosov: 39 Povezava na celotno besedilo