Bounds for the smallest k-chromatic graphs of given girth.

Geoffrey Exoo Jan Goedgebeur

Published in: CoRR (2018)

Keyphrases

upper bound
lower bound
worst case
directed graph
graph matching
series parallel
color information
color images
subgraph isomorphism
upper and lower bounds
weighted graph
error bounds
minimum cost
graph databases
complex structures
bipartite graph
tight bounds