Adjacent vertex distinguishing edge-colorings of planar graphs with girth at least six.
Yuehua BuKo-Wei LihWeifan WangPublished in: Discuss. Math. Graph Theory (2011)
Keyphrases
- planar graphs
- undirected graph
- minimum weight
- weighted graph
- edge weights
- approximation algorithms
- directed graph
- spanning tree
- directed acyclic graph
- bipartite graph
- minimum cost
- connected components
- graph structure
- complex networks
- edge detection
- graph coloring
- upper bound
- edge information
- edge map
- minimum spanning tree
- higher order