Complexity of domination, Hamiltonicity and treewidth for tree convex bipartite graphs (Q328696): Difference between revisions

From MaRDI portal
Importer (talk | contribs)
Created a new Item
 
Importer (talk | contribs)
Changed an Item
Property / Mathematics Subject Classification ID
 
Property / Mathematics Subject Classification ID: 05C69 / rank
 
Normal rank
Property / Mathematics Subject Classification ID
 
Property / Mathematics Subject Classification ID: 05C45 / rank
 
Normal rank
Property / zbMATH DE Number
 
Property / zbMATH DE Number: 6641529 / rank
 
Normal rank
Property / zbMATH Keywords
 
NP-completeness
Property / zbMATH Keywords: NP-completeness / rank
 
Normal rank
Property / zbMATH Keywords
 
domination
Property / zbMATH Keywords: domination / rank
 
Normal rank
Property / zbMATH Keywords
 
Hamiltonianicity
Property / zbMATH Keywords: Hamiltonianicity / rank
 
Normal rank
Property / zbMATH Keywords
 
treewidth
Property / zbMATH Keywords: treewidth / rank
 
Normal rank
Property / zbMATH Keywords
 
tree convex bipartite graphs
Property / zbMATH Keywords: tree convex bipartite graphs / rank
 
Normal rank

Revision as of 03:35, 28 June 2023

scientific article
Language Label Description Also known as
English
Complexity of domination, Hamiltonicity and treewidth for tree convex bipartite graphs
scientific article

    Statements

    Complexity of domination, Hamiltonicity and treewidth for tree convex bipartite graphs (English)
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    20 October 2016
    0 references
    NP-completeness
    0 references
    domination
    0 references
    Hamiltonianicity
    0 references
    treewidth
    0 references
    tree convex bipartite graphs
    0 references

    Identifiers