Complexity of domination, Hamiltonicity and treewidth for tree convex bipartite graphs (Q328696): Difference between revisions
From MaRDI portal
Set profile property. |
Set OpenAlex properties. |
||
| Property / full work available at URL | |||
| Property / full work available at URL: https://doi.org/10.1007/s10878-015-9917-3 / rank | |||
Normal rank | |||
| Property / OpenAlex ID | |||
| Property / OpenAlex ID: W2252286593 / rank | |||
Normal rank | |||
Revision as of 23:58, 19 March 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
