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 - 10 / 14
First pagePrevious page12Next pageLast page
1.
Extremely high MHC class I variation in a population of a long-distance migrant, the Scarlet Rosefinch (Carpodacus erythrinus)
Marta Promerová, Tomáš Albrecht, Josef Bryja, 2009, original scientific article

Found in: ključnih besedah
Summary of found: Zadetek v naslovu
Keywords: MHC class I, Scarlet Rosefinch, Carpodacus erythrinus, positive selection, recombination
Published: 15.10.2013; Views: 1159; Downloads: 76
URL Full text (0,00 KB)
This document has more files! More...

2.
3.
A note on domination and independence-domination numbers of graphs
Martin Milanič, 2013, published scientific conference contribution

Abstract: Vizing's conjecture is true for graphs ▫$G$▫ satisfying ▫$\gamma^i(G) = \gamma(G)$▫, where ▫$\gamma(G)$▫ is the domination number of a graph ▫$G$▫ and ▫$\gamma^i(G)$▫ is the independence-domination number of ▫$G$▫, that is, the maximum, over all independent sets ▫$I$▫ in ▫$G$▫, of the minimum number of vertices needed to dominate ▫$I$▫. The equality ▫$\gamma^i(G) = \gamma(G)$▫ is known to hold for all chordal graphs and for chordless cycles of length ▫$0 \pmod{3}$▫. We prove some results related to graphs for which the above equality holds. More specifically, we show that the problems of determining whether ▫$\gamma^i(G) = \gamma(G) = 2$▫ and of verifying whether ▫$\gamma^i(G) \ge 2$▫ are NP-complete, even if ▫$G$▫ is weakly chordal. We also initiate the study of the equality ▫$\gamma^i = \gamma$▫ in the context of hereditary graph classes and exhibit two infinite families of graphs for which ▫$\gamma^i < \gamma$▫.
Found in: ključnih besedah
Summary of found: ...number, weakly chordal graph, NP-completeness, hereditary graph class, IDD-perfect graph...
Keywords: Vizing's conjecture, domination number, independence-domination number, weakly chordal graph, NP-completeness, hereditary graph class, IDD-perfect graph
Published: 15.10.2013; Views: 1281; Downloads: 67
URL Full text (0,00 KB)

4.
Graphs of separability at most 2
Ferdinando Cicalese, Martin Milanič, 2012, published scientific conference contribution

Found in: ključnih besedah
Summary of found: ...separability, hereditary class, separating clique, decomposition, induced subgraph, induced minor,...
Keywords: separability, hereditary class, separating clique, decomposition, induced subgraph, induced minor, parsimony haplotyping
Published: 15.10.2013; Views: 1017; Downloads: 49
URL Full text (0,00 KB)

5.
Constructions of bent-negabent functions and their relation to the completed Maiorana-McFarland class
Enes Pašalić, Fengrong Zhang, Yongzhuang Wei, 2015, original scientific article

Found in: ključnih besedah
Summary of found: Zadetek v naslovu
Keywords: stream ciphers, Boolean functions, bent functions, bent-negabent functions, Maiorana-McFarland class
Published: 15.10.2015; Views: 1451; Downloads: 69
URL Full text (0,00 KB)

6.
Linear separation of connected dominating sets in graphs
Martin Milanič, Nina Chiarelli, 2014, published scientific conference contribution

Found in: ključnih besedah
Summary of found: ...pragovni hipergraf, connected dominating set, hereditary graph class, dually Sperner hypergraph, treshold hypergraph, ...
Keywords: povezana dominantna množica, hereditarni grafovski razred, dualno Spernerjev hipergraf, pragovni hipergraf, connected dominating set, hereditary graph class, dually Sperner hypergraph, treshold hypergraph
Published: 15.10.2015; Views: 1245; Downloads: 46
URL Full text (0,00 KB)

7.
Graph classes with and without powers of bounded clique-width
Martin Milanič, Flavia Bonomo, Luciano Grippo, Martin Dario Safe, 2016, original scientific article

Found in: ključnih besedah
Summary of found: ...clique-width, power of a graph, hereditary graph class, power-bounded clique-width, ...
Keywords: clique-width, power of a graph, hereditary graph class, power-bounded clique-width
Published: 03.04.2017; Views: 631; Downloads: 89
URL Full text (0,00 KB)

8.
The price of connectivity for cycle transversals
Tatiana R. Hartinger, Matthew Johnson, Martin Milanič, Daniël Paulusma, 2015, published scientific conference contribution

Found in: ključnih besedah
Summary of found: ...price of connectivity, hereditary graph class, path, cycle, transversal, ...
Keywords: price of connectivity, hereditary graph class, path, cycle, transversal
Published: 08.08.2016; Views: 1380; Downloads: 42
URL Full text (0,00 KB)

9.
The price of connectivity for cycle transversals
Tatiana R. Hartinger, Matthew Johnson, Martin Milanič, Daniël Paulusma, 2016, original scientific article

Found in: ključnih besedah
Summary of found: ...price of connectivity, hereditary graph class, path, cycle, transversal, ...
Keywords: price of connectivity, hereditary graph class, path, cycle, transversal
Published: 08.08.2016; Views: 844; Downloads: 38
URL Full text (0,00 KB)

10.
Graph classes
Martin Milanič, 2015, published scientific conference contribution abstract (invited lecture)

Found in: ključnih besedah
Summary of found: ...problem nahrbtnika, application of graph theory, graph class, threshold graph, knapsack problem, ...
Keywords: uporaba teorije grafov, razred grafov, pragoven graf, problem nahrbtnika, application of graph theory, graph class, threshold graph, knapsack problem
Published: 08.08.2016; Views: 821; Downloads: 4
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