The complexity of clique graph recognition (Q1019185): Difference between revisions
From MaRDI portal
Created a new Item |
Added link to MaRDI item. |
||
| links / mardi / name | links / mardi / name | ||
Revision as of 21:52, 30 January 2024
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | The complexity of clique graph recognition |
scientific article |
Statements
The complexity of clique graph recognition (English)
0 references
28 May 2009
0 references
clique graphs
0 references
NP-complete problems
0 references
Helly property
0 references
intersection graphs
0 references
