Acyclic edge coloring of graphs with maximum degree 4.
Manu BasavarajuL. Sunil ChandranPublished in: J. Graph Theory (2009)
Keyphrases
- weighted graph
- random graphs
- undirected graph
- connected graphs
- np complete
- minimum spanning trees
- edge information
- np hard
- edge detection
- graph theory
- adjacency graph
- vertex set
- computational complexity
- graph matching
- maximum number
- edge weights
- power law
- neural network
- strongly connected
- subgraph isomorphism
- graph theoretic
- graph databases
- input image
- edge detector