Le problème d'étoiles pour graphes est NP-complèt (Q1151755): Difference between revisions
From MaRDI portal
Set profile property. |
ReferenceBot (talk | contribs) Changed an Item |
||
Property / cites work | |||
Property / cites work: Isomorphism Testing and Symmetry of Graphs / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Q5617548 / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Q4192111 / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Q5771659 / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Some NP-Complete Problems Similar to Graph Isomorphism / rank | |||
Normal rank |
Revision as of 12:07, 13 June 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