Strong cliques in diamond-free graphs
Abstract
No abstract data available
Keywords
maksimalna klika;maksimalna neodvisna množica;graf brez diamantov;krepka klika;simplicialna klika;CIS graf;NP-težek problem;algoritem linearne časovne zahtevnosti;lastnost Erdősa in Hajnala;maximal clique;maximal stable set;diamond-free graph;strong clique;simplicial clique;CIS graph;NP-hard problem;linear-time algorithm;Erdős-Hajnal property;
Data
| Language: | English |
|---|---|
| Year of publishing: | 2020 |
| Typology: | 1.08 - Published Scientific Conference Contribution |
| Organization: | UP - University of Primorska |
| UDC: | 519.17:004 |
| COBISS: |
36185859
|
| ISSN: | 0302-9743 |
| Views: | 1232 |
| 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;CIS graf;NP-težek problem;algoritem linearne časovne zahtevnosti;lastnost Erdősa in Hajnala; |
| Pages: | Str. 261-273 |
| DOI: | 10.1007/978-3-030-60440-0_21 |
| ID: | 15915957 |
Recommended works:
Strong cliques in diamond-free graphs
2020,
no subtitle data available
ǂA ǂcharacterization of Claw-free CIS graphs and new results on the order of CIS graphs
2019,
no subtitle data available
Strong cliques and stable sets
2021,
no subtitle data available
Mind the independence gap
2020,
no subtitle data available
Edge elimination and weighted graph classes
2020,
no subtitle data available