Complexity of domination, Hamiltonicity and treewidth for tree convex bipartite graphs (Q328696): Difference between revisions
From MaRDI portal
ReferenceBot (talk | contribs) Changed an Item |
Normalize DOI. |
||
| (One intermediate revision by one other user not shown) | |||
| Property / DOI | |||
| Property / DOI: 10.1007/s10878-015-9917-3 / rank | |||
| Property / DOI | |||
| Property / DOI: 10.1007/S10878-015-9917-3 / rank | |||
Normal rank | |||
Latest revision as of 14:32, 9 December 2024
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
0 references
0 references
