Ononot — A graph is called k-degenerate if every subgraph has a verte

Guest Session: 1 Question Remaining. Create Account to save progress.

Graph Theorymedium

0:00.0

A graph is called $k$ -degenerate if every subgraph has a vertex of degree at most $k$ . What is the degeneracy of the cycle graph $C_n$ ?