SLO

Login

First page / Search the repository

Search the repository

A- | A+ | Print

Query:	search in
	search in
	search in
	search in
Work type:	* old and bologna study programme
Language:
Search in:
Options:	Show only hits with full text
	Reset

1 - 5 / 5

1

1.

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

Keywords: simplicial vertex, avoidable vertex, maximum weight clique problem, polynomial-time algorithm, hole-cyclically orientable graph
Published in RUP: 03.09.2019; Views: 2959; Downloads: 18
Link to full text

2.

Avoidable vertices and edges in graphs
Jesse Beisegel, Maria Chudnovsky, Vladimir Gurvich, Martin Milanič, Mary Agnes Milanič, 2019, published scientific conference contribution

Keywords: simplicial vertex, avoidable vertex, avoidable edge, avoidable path, maximum weight clique problem, polynomial-time algorithm, hole-cyclically orientable graph
Published in RUP: 20.08.2019; Views: 3439; Downloads: 161
Link to full text

3.

On even-closed regular embeddings of graphs
István Kovács, Klavdija Kutnar, Dragan Marušič, Daniel Pellicer, 2018, original scientific article

Keywords: odd action automorphism, even action automorphism, automorphism group, vertex-transitive graph, orientable-regular map
Published in RUP: 18.07.2018; Views: 4603; Downloads: 131
Link to full text

4.

1-perfectly orientable K4-minor-free and outerplanar graphs
Boštjan Brešar, Tatiana Romina Hartinger, Tim Kos, Martin Milanič, 2017, original scientific article

Keywords: 1-perfectly orientable graph, K4-minor-free graph, outerplanar graph
Published in RUP: 24.01.2018; Views: 4321; Downloads: 137
Link to full text

5.

Nove karakterizacije v strukturni teoriji grafov : 1-popolno usmerljivi grafi, produktni grafi in cena povezanosti
Tatiana Romina Hartinger, 2017, doctoral dissertation

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 in RUP: 09.11.2017; Views: 5123; Downloads: 44
Link to full text

Search done in 0 sec.

Logos of partners