Computing the degreewidth of a digraph is hard (Q7364481)
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 8264773
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Computing the degreewidth of a digraph is hard |
scientific article; zbMATH DE number 8264773 |
Statements
Computing the degreewidth of a digraph is hard (English)
0 references
2 October 2026
0 references
0 references
