Improved bounds on the chromatic numbers of the square of Kneser graphs.
Seog-Jin KimBoram ParkPublished in: Discret. Math. (2014)
Keyphrases
- language model
- upper bound
- tight bounds
- color images
- upper and lower bounds
- graph theoretic
- series parallel
- neural network
- subgraph isomorphism
- lower bound
- graph matching
- database
- graph databases
- lower and upper bounds
- bipartite graph
- graph construction
- graph partitioning
- graph structure
- bayesian networks
- genetic algorithm
- data sets