Upper bounds on the acyclic chromatic index of degenerate graphs.
Nevil AntoManu BasavarajuSuresh Manjanath HegdeShashanka KulamarvaPublished in: Discret. Math. (2024)
Keyphrases
- upper bound
- lower bound
- np hard
- upper and lower bounds
- lower and upper bounds
- connected graphs
- branch and bound
- tight bounds
- worst case
- sample size
- bounded treewidth
- branch and bound algorithm
- index structure
- database
- human perception
- graph matching
- graph model
- scheduling problem
- color images
- np complete
- bipartite graph
- graph mining
- graph theoretic
- graph data
- directed graph
- integrity constraints
- database schemes
- query graph
- pruning power