Adjacent vertex distinguishing edge-coloring of planar graphs with girth at least five.
Xinping XuYiying ZhangPublished in: Ars Comb. (2014)
Keyphrases
- planar graphs
- undirected graph
- minimum weight
- weighted graph
- spanning tree
- directed graph
- complex networks
- edge weights
- directed acyclic graph
- approximation algorithms
- graph structure
- connected components
- minimum cost
- edge information
- bipartite graph
- minimum spanning tree
- edge detection
- lower bound
- edge detector
- greedy heuristic