New bounds on clique-chromatic numbers of Johnson graphs.
Andrei M. RaigorodskiiMikhail M. KoshelevPublished in: Discret. Appl. Math. (2020)
Keyphrases
- maximum clique
- upper bound
- independent set
- lower bound
- quasi cliques
- color images
- graph properties
- worst case
- upper and lower bounds
- lower and upper bounds
- branch and bound algorithm
- graph databases
- graph mining
- graph matching
- error bounds
- graph model
- graph theoretic
- learning algorithm
- graph partitioning
- weighted graph
- average case
- graph kernels
- subgraph isomorphism
- series parallel
- np complete
- special case
- confidence bounds
- image processing