On the choosability of complete multipartite graphs with part size three.

Henry A. Kierstead

Published in: Discret. Math. (2000)

Keyphrases

maximal cliques
graph theory
genetic algorithm
small size
case study
computational complexity
memory requirements
graph matching
pattern recognition
semi supervised
space complexity
maximum number