1. |
2. |
3. Strong cliques in diamond-free graphsNina Chiarelli, Berenice Martínez-Barona, Martin Milanič, Jérôme Monnot, Peter Muršič, 2020, izvirni znanstveni članek Ključne besede: 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 Objavljeno v RUP: 17.12.2020; Ogledov: 1431; Prenosov: 54 Povezava na celotno besedilo |
4. Strong cliques in diamond-free graphsNina Chiarelli, Berenice Martínez-Barona, Martin Milanič, Jérôme Monnot, Peter Muršič, 2020, objavljeni znanstveni prispevek na konferenci Ključne besede: maximal clique, maximal stable set, diamond-free graph, strong clique, simplicial clique, CIS graph, NP-hard problem, linear-time algorithm, Erdős-Hajnal property Objavljeno v RUP: 10.11.2020; Ogledov: 1510; Prenosov: 41 Povezava na celotno besedilo |
5. |
6. |