Vertex-distinguishing edge colorings of graphs.
Paul N. BalisterO. M. RiordanRichard H. SchelpPublished in: J. Graph Theory (2003)
Keyphrases
- undirected graph
- vertex set
- edge weights
- weighted graph
- directed graph
- spanning tree
- graph coloring
- hamiltonian cycle
- directed acyclic graph
- minimum weight
- labeled graphs
- approximation algorithms
- strongly connected
- random graphs
- attributed graphs
- connected components
- graph structure
- maximum cardinality
- bipartite graph
- minimum spanning trees
- minimum cost
- graph matching
- complex networks
- connected subgraphs
- graph theoretic
- graph structures
- graph clustering
- minimum spanning tree
- social networks
- graph partitioning
- densely connected
- edge detection
- pairwise