Boundary properties of graphs for algorithmic graph problems (Q551178): Difference between revisions

From MaRDI portal
Importer (talk | contribs)
Created a new Item
 
Importer (talk | contribs)
Changed an Item
Property / author
 
Property / author: Vadim V. Lozin / rank
 
Normal rank
Property / Mathematics Subject Classification ID
 
Property / Mathematics Subject Classification ID: 05C85 / rank
 
Normal rank
Property / Mathematics Subject Classification ID
 
Property / Mathematics Subject Classification ID: 05C15 / rank
 
Normal rank
Property / Mathematics Subject Classification ID
 
Property / Mathematics Subject Classification ID: 05C45 / rank
 
Normal rank
Property / Mathematics Subject Classification ID
 
Property / Mathematics Subject Classification ID: 68Q17 / rank
 
Normal rank
Property / zbMATH DE Number
 
Property / zbMATH DE Number: 5920432 / rank
 
Normal rank
Property / zbMATH Keywords
 
computational complexity
Property / zbMATH Keywords: computational complexity / rank
 
Normal rank
Property / zbMATH Keywords
 
hereditary class
Property / zbMATH Keywords: hereditary class / rank
 
Normal rank
Property / zbMATH Keywords
 
Hamiltonian cycle
Property / zbMATH Keywords: Hamiltonian cycle / rank
 
Normal rank
Property / zbMATH Keywords
 
vertex colorability
Property / zbMATH Keywords: vertex colorability / rank
 
Normal rank

Revision as of 13:42, 1 July 2023

scientific article
Language Label Description Also known as
English
Boundary properties of graphs for algorithmic graph problems
scientific article

    Statements

    Boundary properties of graphs for algorithmic graph problems (English)
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    14 July 2011
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    computational complexity
    0 references
    hereditary class
    0 references
    Hamiltonian cycle
    0 references
    vertex colorability
    0 references