Complexity of domination, Hamiltonicity and treewidth for tree convex bipartite graphs (Q328696)
From MaRDI portal
 | This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use this page instead for the normal view: Complexity of domination, Hamiltonicity and treewidth for tree convex bipartite graphs |
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
20 October 2016
0 references
NP-completeness
0 references
domination
0 references
Hamiltonianicity
0 references
treewidth
0 references
tree convex bipartite graphs
0 references
