Le problème d'étoiles pour graphes est NP-complèt (Q1151755): Difference between revisions

From MaRDI portal
Added link to MaRDI item.
Set OpenAlex properties.
 
(2 intermediate revisions by 2 users not shown)
Property / MaRDI profile type
 
Property / MaRDI profile type: Publication / rank
 
Normal rank
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
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 11: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
    0 references
    1981
    0 references
    NP-complete
    0 references
    chromatic automorphism
    0 references
    vertex neighbourhood
    0 references
    star problem
    0 references

    Identifiers