Acyclic coloring of graphs of maximum degree five: Nine colors are enough.
Guillaume FertinAndré RaspaudPublished in: Inf. Process. Lett. (2008)
Keyphrases
- random graphs
- color images
- connected graphs
- np complete
- graph matching
- np hard
- graph theoretic
- graph structure
- graph representation
- graph databases
- color information
- graph mining
- maximum number
- bipartite graph
- directed graph
- database schemes
- small number
- objective function
- graph theory
- bounded treewidth
- markov equivalence classes