Acyclic edge colourings of graphs with large girth.
Xing Shi CaiGuillem PerarnauBruce A. ReedAdam Bene WattsPublished in: CoRR (2014)
Keyphrases
- weighted graph
- undirected graph
- connected graphs
- edge detection
- edge information
- strongly connected
- directed graph
- minimum spanning trees
- bounded treewidth
- graph theoretic
- graph theory
- graph matching
- np hard
- graph databases
- np complete
- adjacency graph
- edge weights
- database schemes
- objective function
- markov equivalence classes
- random graphs
- multiple scales
- graph partitioning
- graph model
- special case
- lower bound