Abstract
The arboricity of a graph G is the minimum number of colours needed to colour the edges of G so that every cycle gets at least two colours. Given a positive integer p, we define the generalized p-arboricity Arbp(G) of a graph G as the minimum number of colours needed to colour the edges of a multigraph G in such a way that every cycle C gets at least min(|C|,p+1) colours. In the particular case where G has girth at least p+1, Arbp(G) is the minimum size of a partition of the edge set of G such that the union of any p parts induces a forest. In this paper, we relate the generalized p-arboricity of a graph G to the maximum density of a multigraphs having a shallow subdivision (where edges are becoming paths of length at most p) as a subgraph of G, by proving that each of these values is bounded by a polynomial function of the other.
Sign-in/Register to access full text options 
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a callDisclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.
