Login
Lupa
First page / Search the repository

Search the repository Help

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

Options:
  Reset


1 - 4 / 4
First pagePrevious page1Next pageLast page
1.
Strong cliques in diamond-free graphs
Nina Chiarelli, Berenice Martínez-Barona, Martin Milanič, Jérôme Monnot, Peter Muršič, 2020, original scientific article

Keywords: maximal clique, maximal stable set, diamond-free graph, strong clique, simplicial clique, strongly perfect graph, CIS graph, NP-hard problem, polynomial-time algorithm, Erdős-Hajnal property
Published in RUP: 17.12.2020; Views: 1260; Downloads: 39
URL Link to full text

2.
Strong cliques in diamond-free graphs
Nina Chiarelli, Berenice Martínez-Barona, Martin Milanič, Jérôme Monnot, Peter Muršič, 2020, published scientific conference contribution

Keywords: maximal clique, maximal stable set, diamond-free graph, strong clique, simplicial clique, CIS graph, NP-hard problem, linear-time algorithm, Erdős-Hajnal property
Published in RUP: 10.11.2020; Views: 1363; Downloads: 36
URL Link to full text

3.
A characterization of Claw-free CIS graphs and new results on the order of CIS graphs
Liliana Alcón, Marisa Gutierreza, Martin Milanič, 2019, original scientific article

Keywords: CIS graph, maximal clique, maximal stable set, maximal independent set, randomly internally matchable graph, claw-free graph
Published in RUP: 16.10.2019; Views: 1690; Downloads: 60
URL Link to full text

4.
On the recognition of k-equistable graphs
Vadim E. Levit, Martin Milanič, D. Tankus, 2012, published scientific conference contribution

Keywords: maximal stable set, equistable graph, polynomial time algorithm
Published in RUP: 15.10.2013; Views: 2816; Downloads: 129
URL Link to full text
Search done in 0 sec.
Back to top
Logos of partners University of Maribor University of Ljubljana University of Primorska University of Nova Gorica