On the Vertex-Distinguishing Proper Edge-Colorings of Graphs.
Cristina BazganAmel Harkat-BenhamdineHao LiMariusz WozniakPublished in: J. Comb. Theory, Ser. B (1999)
Keyphrases
- undirected graph
- vertex set
- edge weights
- weighted graph
- directed graph
- hamiltonian cycle
- graph coloring
- minimum weight
- spanning tree
- approximation algorithms
- graph structure
- labeled graphs
- attributed graphs
- complex networks
- random graphs
- directed acyclic graph
- graph partitioning
- connected components
- minimum cost
- graph theory
- strongly connected
- minimum spanning trees
- graph theoretic
- shortest path
- combinatorial problems
- graph representation
- edge information
- edge detection
- adjacency graph
- bipartite graph
- maximum cardinality
- graph clustering
- graph structures
- small world
- series parallel
- graph databases
- graph mining
- edge detector
- connected subgraphs