Vertex-distinguishing proper edge colourings of some regular graphs.
Janka RudasováRoman SotákPublished in: Discret. Math. (2008)
Keyphrases
- undirected graph
- vertex set
- edge weights
- weighted graph
- directed graph
- labeled graphs
- approximation algorithms
- minimum weight
- graph structure
- spanning tree
- attributed graphs
- adjacency matrix
- random graphs
- edge detection
- complex networks
- minimum cost
- maximum cardinality
- hamiltonian cycle
- connected components
- minimum spanning tree
- directed acyclic graph
- graph matching
- graph theoretic
- edge detector
- graph theory
- shortest path
- adjacency graph
- edge information
- graph construction
- series parallel
- strongly connected
- graphical models
- image segmentation
- minimum spanning trees
- connected subgraphs
- graph model