Graphs of bounded cliquewidth are polynomially χ-bounded.

Marthe Bonamy Michal Pilipczuk

Published in: CoRR (2019)

Keyphrases

polynomially bounded
graph theory
bounded treewidth
graph theoretic
graph matching
graph mining
bipartite graph
graph isomorphism
graph representation
graph structure
data structure
website
real time
directed graph
similarity measure
case study
structured objects
information retrieval
neural network