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 - 4 / 4

1

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: 4739; Downloads: 164
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: 4253; Downloads: 64
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: 3740; Downloads: 69
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: 4573; Downloads: 136
Link to full text

Search done in 0 sec.

Logos of partners