The complexity of finding low chromatic spanning sub(di)graphs with prescribed connectivity properties (Q2686111)
From MaRDI portal
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | The complexity of finding low chromatic spanning sub(di)graphs with prescribed connectivity properties |
scientific article |
Statements
The complexity of finding low chromatic spanning sub(di)graphs with prescribed connectivity properties (English)
0 references
24 February 2023
0 references
NP-completeness
0 references
polynomial algorithm
0 references
chromatic number
0 references
spanning trees
0 references
out-branchings
0 references
connectivity
0 references
