Upper bounds for the strong chromatic index of Halin graphs.
Daphne Der-Fen LiuZiyu HuKo-Wei LihPublished in: Discuss. Math. Graph Theory (2018)
Keyphrases
- upper bound
- lower bound
- upper and lower bounds
- lower and upper bounds
- tight bounds
- worst case
- branch and bound
- sample complexity
- graph mining
- graph model
- graph clustering
- branch and bound algorithm
- database
- graph databases
- inverted index
- index structure
- color images
- error probability
- graph matching
- graph representation
- directed graph
- graph theoretic
- np hard
- subgraph isomorphism