The complexity of partitioning into disjoint cliques and a...

  • Main
  • 2016 / 11
  • The complexity of partitioning into disjoint cliques and a...
Discrete Applied Mathematics 2016 / 11

The complexity of partitioning into disjoint cliques and a triangle-free graph

Bougeret, Marin, Ochem, Pascal
How much do you like this book?
What’s the quality of the file?
Download the book for quality assessment
What’s the quality of the downloaded files?
Language:
english
Journal:
Discrete Applied Mathematics
DOI:
10.1016/j.dam.2016.10.004
Date:
November, 2016
File:
PDF, 551 KB
english, 2016
Conversion to is in progress
Conversion to is failed