| 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: | 1891 |
|---|
| Downloads: | 85 |
|---|
| Metadata: |    |
|---|
|
:
|
Copy citation |
|---|
| | | | Average score: | (0 votes) |
|---|
| Your score: | Voting is allowed only for logged in users. |
|---|
| Share: |  |
|---|
Hover the mouse pointer over a document title to show the abstract or click
on the title to get all document metadata. |
