Login / Signup
Infinitely many minimal classes of graphs of unbounded clique-width.
Andrew Collins
Jan Foniok
Nicholas Korpelainen
Vadim V. Lozin
Victor Zamaraev
Published in:
Discret. Appl. Math. (2018)
Keyphrases
</>
independent set
graph properties
algebraic structures
graph theoretic
maximum clique
graph matching
graph theory
directed graph
bipartite graph
finite number
training data
graph partitioning
random graphs
quasi cliques