Skip to main navigation Skip to search Skip to main content

On the complexity of the k-independence number and the h-diameter of a graph

Aida Abiad, Hidde Koerts

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

Fingerprint

Dive into the research topics of 'On the complexity of the k-independence number and the h-diameter of a graph'. Together they form a unique fingerprint.
Sort by

Computer Science