Unlike the chromatic index, the arboricity of a graph may be computed in polynomial time.
Δηλαδή είναι ο ελάχιστος αριθμός Unlike the chromatic index, the arboricity of a graph may be computed in polynomial time.