Lupa

Search the repository Help

A- | A+ | Print
Query: search in
search in
search in
search in
* old and bolonia study programme

Options:
  Reset


1 - 5 / 5
First pagePrevious page1Next pageLast page
1.
2.
1-perfectly orientable K4-minor-free and outerplanar graphs
Boštjan Brešar, Tatiana Romina Hartinger, 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: 1139; Downloads: 84
URL Full text (0,00 KB)

3.
On even-closed regular embeddings of graphs
István Kovács, Klavdija Kutnar, 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: 930; Downloads: 82
URL Full text (0,00 KB)

4.
Avoidable vertices and edges in graphs
Jesse Beisegel, Maria Chudnovsky, Vladimir Gurvich, Martin Milanič, Mary Servatius, 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: 216; Downloads: 77
URL 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. 19
Martin 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: 144; Downloads: 1
URL Full text (0,00 KB)

Search done in 0 sec.
Back to top
Logos of partners University of Maribor University of Ljubljana University of Primorska University of Nova Gorica