Edge arboricity : Do we need equitabilility ?
From MaRDI portal
Abstract: In this paper we study a new variant of graph arboricity, which requires all the forests to have the same number of edges (up to a difference of 1). We prove that the new variant, which we call equitable arboricity, is equivalent to ordinary arboricity. In other words we show that any arborescent decomposition of a graph can be transformed into an equitable one without modifying the number of used forests.
This page was built for publication: Edge arboricity : Do we need equitabilility ?
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6286171)