Le problème d'étoiles pour graphes est NP-complèt (Q1151755): Difference between revisions
From MaRDI portal
Created a new Item |
Added link to MaRDI item. |
||
| links / mardi / name | links / mardi / name | ||
Revision as of 05:24, 31 January 2024
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Le problème d'étoiles pour graphes est NP-complèt |
scientific article |
Statements
Le problème d'étoiles pour graphes est NP-complèt (English)
0 references
1981
0 references
NP-complete
0 references
chromatic automorphism
0 references
vertex neighbourhood
0 references
star problem
0 references
