Adjacent-vertex-distinguishing proper edge colorings of planar bipartite graphs with Δ = 9, 10, or 11.
Xiang'en ChenZepeng LiPublished in: Inf. Process. Lett. (2015)
Keyphrases
- bipartite graph
- edge weights
- minimum weight
- maximum cardinality
- planar graphs
- maximum matching
- link prediction
- maximum weight
- weighted graph
- undirected graph
- bipartite graph matching
- edge detection
- minimum spanning tree
- graph coloring
- graph clustering
- machine learning
- bipartite networks
- shortest path
- active learning
- web pages