A graph is called $n$-degenerate if each of its subgraphs has a vertex of degree at most $n$. For each $n$ the Lick-White number of graph $G$ is the fewest number of ...