Strong cliques in diamond-free graphs

SLO

First page / Show document

Show document

A- | A+ | Print

Title:	Strong cliques in diamond-free graphs
Authors:	ID Chiarelli, Nina (Author) ID Martínez-Barona, Berenice (Author) ID Milanič, Martin (Author) ID Monnot, Jérôme (Author) ID Muršič, Peter (Author)
Files:	https://www.sciencedirect.com/science/article/abs/pii/S0304397520307088?via%3Dihub
Language:	English
Work type:	Unknown
Typology:	1.01 - Original Scientific Article
Organization:	IAM - Andrej Marušič Institute
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
Year of publishing:	2020
Number of pages:	str. 1-22
PID:	20.500.12556/RUP-14671
UDC:	519.17
ISSN on article:	0304-3975
DOI:	10.1016/j.tcs.2020.12.001
COBISS.SI-ID:	42440451
Publication date in RUP:	17.12.2020
Views:	2497
Downloads:	119
Metadata:
:	CHIARELLI, Nina, MARTÍNEZ-BARONA, Berenice, MILANIČ, Martin, MONNOT, Jérôme and MURŠIČ, Peter, 2020, Strong cliques in diamond-free graphs. Theoretical computer science [online]. 2020. P. 1–22. [Accessed 5 April 2025]. DOI 10.1016/j.tcs.2020.12.001. Retrieved from: https://www.sciencedirect.com/science/article/abs/pii/S0304397520307088?via%3Dihub Copy citation

Average score:	0.5 1 1.5 2 2.5 3 3.5 4 4.5 5 (0 votes)
Your score:	Voting is allowed only for logged in users.
Share:

Similar works from our repository:

Similar works from other repositories:

Hover the mouse pointer over a document title to show the abstract or click on the title to get all document metadata.

Title:	Theoretical computer science
Shortened title:	Theor. comp. sci.
Publisher:	Elsevier
ISSN:	0304-3975
COBISS.SI-ID:	26525952

Language:	English
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

Leave comment

You must log in to leave a comment.

Comments (0)

0 - 0 / 0

There are no comments!

Back