Adjacent vertex-distinguishing edge coloring of graphs with maximum degree Δ.
Hervé HocquardMickaël MontassierPublished in: J. Comb. Optim. (2013)
Keyphrases
- undirected graph
- random graphs
- vertex set
- edge weights
- directed graph
- weighted graph
- labeled graphs
- spanning tree
- strongly connected
- minimum weight
- graph structure
- attributed graphs
- minimum spanning trees
- connected components
- hamiltonian cycle
- complex networks
- minimum cost
- directed acyclic graph
- approximation algorithms
- graph theoretic
- bipartite graph
- average degree
- graph matching
- shortest path
- maximum number
- graph mining
- graph databases
- minimum spanning tree
- graph model
- maximum cardinality