Acyclic edge colorings of graphs.
Noga AlonBenny SudakovAyal ZaksPublished in: J. Graph Theory (2001)
Keyphrases
- weighted graph
- undirected graph
- connected graphs
- graph matching
- bounded treewidth
- edge information
- np complete
- minimum spanning trees
- random graphs
- np hard
- edge weights
- graph theoretic
- graph clustering
- graph coloring
- strongly connected
- subgraph isomorphism
- scheduling problem
- graph representation
- graph partitioning
- directed graph
- edge detection
- graph construction
- graph mining
- graph structure
- graph theory
- edge detector
- vertex set
- markov equivalence classes