1. Nove karakterizacije v strukturni teoriji grafovTatiana Romina Hartinger, 2017, doctoral dissertation Found in: ključnih besedah
Summary of found: ... 1-perfectly orientable graph, structural characterization of families of...
Keywords: 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 transversal
Published: 09.11.2017; Views: 1736; Downloads: 29
 Full text (0,00 KB) |
2. 1-perfectly orientable K4-minor-free and outerplanar graphsTatiana Romina Hartinger, Boštjan Brešar, Tim Kos, Martin Milanič, 2017, original scientific article Found in: ključnih besedah
Summary of found: ...1-perfectly orientable graph, K4-minor-free graph, outerplanar graph...
Keywords: 1-perfectly orientable graph, K4-minor-free graph, outerplanar graph
Published: 24.01.2018; Views: 2457; Downloads: 128
Full text (0,00 KB) |
3. On even-closed regular embeddings of graphsKlavdija Kutnar, István Kovács, Dragan Marušič, Daniel Pellicer, 2018, original scientific article Found in: ključnih besedah
Summary of found: ...even action automorphism, automorphism group, vertex-transitive graph, orientable-regular map...
Keywords: odd action automorphism, even action automorphism, automorphism group, vertex-transitive graph, orientable-regular map
Published: 18.07.2018; Views: 2221; Downloads: 123
Full text (0,00 KB) |
4. Avoidable vertices and edges in graphsMartin Milanič, Vladimir Gurvich, Mary Agnes Milanič, Maria Chudnovsky, Jesse Beisegel, 2019, published scientific conference contribution Found in: ključnih besedah
Summary of found: ...maximum weight clique problem, polynomial-time algorithm, hole-cyclically orientable graph...
Keywords: simplicial vertex, avoidable vertex, avoidable edge, avoidable path, maximum weight clique problem, polynomial-time algorithm, hole-cyclically orientable graph
Published: 20.08.2019; Views: 1399; Downloads: 150
Full text (0,00 KB) |
5. Generalizations of simplicial vertices and a new polynomially solvable case of the maximum weight clique problem, National Research University Higher School of Economics, Faculty of Computer Science, Moscow, 21. 8. 19Martin Milanič, 2019, invited lecture at foreign university Found in: ključnih besedah
Summary of found: ...maximum weight clique problem, polynomial-time algorithm, hole-cyclically orientable graph...
Keywords: simplicial vertex, avoidable vertex, maximum weight clique problem, polynomial-time algorithm, hole-cyclically orientable graph
Published: 03.09.2019; Views: 1127; Downloads: 14
Full text (0,00 KB) |
