On the complexity of embedding in graph products (Q6913039)
From MaRDI portal
!
This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use the normal view instead:
scientific article; zbMATH DE number 8108998
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | On the complexity of embedding in graph products |
scientific article; zbMATH DE number 8108998 |
Statements
On the complexity of embedding in graph products (English)
0 references
21 October 2025
0 references
row treewidth
0 references
row pathwidth
0 references
row treedepth
0 references
graph product structure
0 references
NP-completeness
0 references
