# Vertex-arboricity

Not what you're looking for? Search our solutions OR ask your own Custom question.

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.

Â© BrainMass Inc. brainmass.com December 24, 2021, 4:47 pm ad1c9bdddfhttps://brainmass.com/math/vector-calculus/vertex-arboricity-proof-7558

#### 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. The critical graph with respect to vertex arboricity is analyzed.

$2.49