On Vertex-Distinguishing Proper Edge Colorings of Graphs Satisfying the Ore Condition.
Meirun ChenXiaofeng GuoPublished in: Ars Comb. (2010)
Keyphrases
- undirected graph
- edge weights
- vertex set
- weighted graph
- directed graph
- spanning tree
- minimum weight
- labeled graphs
- approximation algorithms
- directed acyclic graph
- hamiltonian cycle
- attributed graphs
- graph coloring
- complex networks
- random graphs
- graph matching
- sufficient conditions
- connected components
- connected subgraphs
- graph structure
- strongly connected
- series parallel
- shortest path
- edge detection
- graph data
- minimum cost
- edge detector
- maximum cardinality
- edge information
- bipartite graph
- social network analysis
- random walk