New bounds for locally irregular chromatic index of bipartite and subcubic graphs.
Borut LuzarJakub PrzybyloRoman SotákPublished in: J. Comb. Optim. (2018)
Keyphrases
- graph model
- bipartite graph
- graph partitioning
- color images
- undirected graph
- upper bound
- upper and lower bounds
- lower bound
- index structure
- graph representation
- query graph
- globally consistent
- lower and upper bounds
- graph mining
- graph matching
- graph databases
- vertex set
- database
- graph theoretic
- graph kernels
- worst case
- human perception
- color information
- directed graph
- shortest path
- edge weights
- graph clustering
- bipartite networks