The complexity of finding low chromatic spanning sub(di)graphs with prescribed connectivity properties (Q2686111)
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 7657066
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | The complexity of finding low chromatic spanning sub(di)graphs with prescribed connectivity properties |
scientific article; zbMATH DE number 7657066 |
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
0.8048979043960571
0 references
0.8011094927787781
0 references
0.7838477492332458
0 references
0.7833760976791382
0 references
