Iskalni niz:
išči po
išči po
išči po
išči po
Vrsta gradiva:
Jezik:
Št. zadetkov: 7
Nove karakterizacije v strukturni teoriji grafov
Tatiana Romina Hartinger, Martin Milanič
Doktorska disertacija
Oznake: 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;
Leto: 2017 Vir: Fakulteta za matematiko, naravoslovje in informacijske tehnologije Koper (UP FAMNIT)
The price of connectivity for cycle transversals
Tatiana Romina Hartinger, Matthew Johnson, Martin Milanič, Daniël Paulusma
Objavljeni znanstveni prispevek na konferenci
Oznake: price of connectivity;hereditary graph class;path;cycle;transversal;
The price of connectivity for cycle transversals
Leto: 2015 Vir: Univerza na Primorskem (UP)
The price of connectivity for cycle transversals
Tatiana Romina Hartinger, Matthew Johnson, Martin Milanič, Daniël Paulusma
Izvirni znanstveni članek
Oznake: price of connectivity;hereditary graph class;path;cycle;transversal;
The price of connectivity for cycle transversals
Leto: 2016 Vir: Univerza na Primorskem (UP)
1-perfectly orientable K[sub]4-minor-free and outerplanar graphs
Boštjan Brešar, Tatiana Romina Hartinger, Tim Kos, Martin Milanič
Izvirni znanstveni članek
Oznake: 1-perfectly orientable graph;▫$K_4$▫-minor-free graph;outerplanar graph;
A graph ▫$G$▫ is said to be 1-perfectly orientable if it has an orientation ▫$D$▫ such that for every vertex ▫$v \in V(G)$▫, the out-neighborhood of ▫$v$▫ in ▫$D$▫ is a clique in ▫$G$▫. D. J. Skrien [J. Graph Theory 6, 309--316 (1982)] posed the problem of characterizing the class of 1-perfectly ori ...
Leto: 2018 Vir: Fakulteta za naravoslovje in matematiko (UM FNM)
On two extensions of equimatchable graphs
Tatiana Romina Hartinger, Martin Milanič, Mordechai Shalom, Zakir Deniz, Tinaz Ekim
Izvirni znanstveni članek
Oznake: najmanjše maksimalno prirejanje;graf enako velikih maksimalnih prirejanj;povezavno dominantna množica;Gallai-Edmondsova dekompozicija;parameterizirana računska zahtevnost;minimum maximal matching;equimatchable graph;edge dominating set;Gallai-Edmonds decomposition,;parameterized complexity;
On two extensions of equimatchable graphs
Leto: 2017 Vir: Univerza na Primorskem (UP)
Improved algorithms for k-domination and total k-domination in proper interval graphs
Nina Chiarelli, Tatiana Romina Hartinger, Valeria Alejandra Leoni, Marina Inés Lopez Pujato, Martin Milanič
Objavljeni znanstveni prispevek na konferenci
Oznake: k-dominacija;popolna k-dominacija;pravi intervalni graf;polinomski algoritem;k-domination;total k-domination;proper interval graph;polynomial-time algorithm;
Improved algorithms for k-domination and total k-domination in proper interval graphs
Leto: 2018 Vir: Univerza na Primorskem (UP)
New algorithms for weighted k-domination and total k-domination problems in proper interval graphs
Nina Chiarelli, Tatiana Romina Hartinger, Valeria Alejandra Leoni, Marina Inés Lopez Pujato, Martin Milanič
Izvirni znanstveni članek
Oznake: k-dominacija;popolna k-dominacija;pravi intervalni graf;polinomski algoritem;k-domination;total k-domination;proper interval graph;polynomial-time algorithm;
New algorithms for weighted k-domination and total k-domination problems in proper interval graphs
Leto: 2019 Vir: Univerza na Primorskem (UP)
Št. zadetkov: 7
Ključne besede:
Leto izdaje:
Avtorji:
Repozitorij:
Tipologija:
Jezik: