Vertex Distinguishing Edge- and Total-Colorings of Cartesian and other Product Graphs.
Jean-Luc BarilHamamache KheddouciOlivier TogniPublished in: Ars Comb. (2012)
Keyphrases
- undirected graph
- vertex set
- edge weights
- weighted graph
- directed graph
- hamiltonian cycle
- graph coloring
- approximation algorithms
- minimum weight
- labeled graphs
- attributed graphs
- strongly connected
- life cycle
- spanning tree
- graph structure
- connected components
- bipartite graph
- directed acyclic graph
- complex networks
- minimum cost
- graph matching
- expected profit
- random graphs
- minimum spanning trees
- graph theory
- product quality
- product development
- product design
- average degree
- product information
- subgraph isomorphism
- minimum spanning tree
- graph theoretic
- edge information
- social network analysis
- constraint satisfaction problems