Skip to main navigation Skip to search Skip to main content

The complexity of finding low chromatic spanning sub(di)graphs with prescribed connectivity properties

  • University of Southern Denmark

Research output: Contribution to journal › Article › peer-review

Fingerprint

Dive into the research topics of 'The complexity of finding low chromatic spanning sub(di)graphs with prescribed connectivity properties'. Together they form a unique fingerprint.
Sort by

Keyphrases

Mathematics