Le problème d'étoiles pour graphes est NP-complèt (Q1151755): Difference between revisions
From MaRDI portal
ReferenceBot (talk | contribs) Changed an Item |
Set OpenAlex properties. |
||
| Property / full work available at URL | |||
| Property / full work available at URL: https://doi.org/10.1016/0012-365x(81)90271-5 / rank | |||
Normal rank | |||
| Property / OpenAlex ID | |||
| Property / OpenAlex ID: W2084665552 / rank | |||
Normal rank | |||
Latest revision as of 10:46, 30 July 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
