Back to Search
Start Over
The complexity of finding low chromatic spanning sub(di)graphs with prescribed connectivity properties
- Source :
- Theoretical Computer Science. 949:113758
- Publication Year :
- 2023
- Publisher :
- Elsevier BV, 2023.
- Subjects :
- General Computer Science
Theoretical Computer Science
Subjects
Details
- ISSN :
- 03043975
- Volume :
- 949
- Database :
- OpenAIRE
- Journal :
- Theoretical Computer Science
- Accession number :
- edsair.doi...........80e237edaaae5f3a74c57ce7951388be
- Full Text :
- https://doi.org/10.1016/j.tcs.2023.113758