Bounds for the smallest k-chromatic graphs of given girth.
Geoffrey ExooJan GoedgebeurPublished in: Discret. Math. Theor. Comput. Sci. (2019)
Keyphrases
- lower bound
- upper bound
- directed graph
- color images
- graph matching
- graph theoretic
- series parallel
- worst case
- graph theory
- lower and upper bounds
- upper and lower bounds
- human perception
- bipartite graph
- graph structure
- graphical models
- graph mining
- average case
- tight bounds
- database
- structured objects
- graph partitioning
- graph databases
- graph model
- data structure
- image processing
- neural network