An oriented 8-coloring for acyclic oriented graphs with maximum degree 3.

Hebert Coelho Luérbio Faria Sylvain Gravier Sulamita Klein

Published in: CTW (2013)

Keyphrases

graph matching
graph model
databases
clustering algorithm
np hard
graph theoretic