Strong cliques in diamond-free graphs

Nina Chiarelli (Author), Berenice Martínez-Barona (Author), Martin Milanič (Author), Jérôme Monnot (Author), Peter Muršič (Author)

Abstract

No abstract data available

Keywords

maksimalna klika;maksimalna neodvisna množica;graf brez diamantov;krepka klika;simplicialna klika;krepko popoln graf;CIS graf;NP-težek problem;polinomski algoritem;lastnost Erdősa in Hajnala;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;

Data

Language:	English
Year of publishing:	2021
Typology:	1.01 - Original Scientific Article
Organization:	UP - University of Primorska
UDC:	519.17
COBISS:	42440451
ISSN:	0304-3975
Views:	1086
Downloads:	34
Average score:	0 (0 votes)
Metadata:

Other data

Secondary language:	English
Secondary keywords:	maksimalna klika;maksimalna neodvisna množica;graf brez diamantov;krepka klika;simplicialna klika;krepko popoln graf;CIS graf;NP-težek problem;polinomski algoritem;lastnost Erdősa in Hajnala;
Pages:	str. 49-63
Issue:	ǂVol. ǂ858
Chronology:	2021
DOI:	10.1016/j.tcs.2020.12.001
ID:	16487612