arboricity

• 2019 Sorge2019
  • page 3 : arboricity – The \emph{arboricity} of a graph $G$ is the minimum number of forests the edges of $G$ can be partitioned into.
  • page 8 : arboricity $k$ upper bounds degeneracy by $\mathcal O(k)$ – Lemma 4.5
  • page 8 : degeneracy $k$ upper bounds arboricity by $\mathcal O(k)$ – Lemma 4.5
• 2007 GeometricThickness2007
  • page 5 : treewidth $k$ upper bounds arboricity by $\mathcal O(k)$ – Proposition 2. The maximum arboricity of a graph in $\mathcal T_k$ (ed: $k$-tree) is $k$; …