Skip to main navigation Skip to search Skip to main content

On the Complexity of Rainbow Vertex Colouring Diametral Path Graphs

  • University of Bergen

Research output: Conference Article in Proceeding or Book/Report chapter › Article in proceedings › Research › peer-review

Fingerprint

Dive into the research topics of 'On the Complexity of Rainbow Vertex Colouring Diametral Path Graphs'. Together they form a unique fingerprint.
Sort by

Keyphrases

Mathematics