Share
Explore BrainMass

Vertex-arboricity

Let G be k-critical graph with respect to vertex-arboricity (k>=3). Prove that for each vertex v of G, the graph G-v is not (k-1)-critical with respect to vertex-arboricity.

Solution Preview

Proof. If not, then there exists a vertex v of G such that G-v is (k-1)-critical which means that for each ...

Solution Summary

This is a proof regarding vertex-arboricity.

$2.19