Infinitely many minimal classes of graphs of unbounded clique-width.

Andrew Collins Jan Foniok Nicholas Korpelainen Vadim V. Lozin Victor Zamaraev

Published in: CoRR (2017)

Keyphrases

maximum clique
independent set
algebraic structures
graph properties
graph representation
graph matching
graph theory
data sets
graph partitioning
maximum independent set
bounded treewidth
graph construction
graph clustering
graph databases
graph mining
finite number
bipartite graph
directed graph
feature selection