Global ETD Search

Search theses and dissertations gathered from participating repositories worldwide. Every result links back to the library that holds it. No account is needed.

Results

Showing 1 to 2 of 2 for “"linear arboricity"”.

  1. Arboricity and transversal problems on bounded degree graphs

    In this thesis, we investigate arboricity and transversal problems on graphs in a bounded degree setting. We pay particular attention to problems involving both the maximum degree and maximum density of the graphs. The first topic is bounded degree arboricity. The arboricity of a multigraph $G$ is …

    waterloo Repository record for Arboricity and transversal problems on bounded degree graphs (opens in a new tab)

  2. Putting the pieces together: from graph decompositions to Ramsey theory

    … <br><br>A celebrated problem in this area is the Linear Arboricity Conjecture, which states that the edges of every graph with maximum degree $\Delta$ can be decomposed into at most $\lceil (\Delta+1)/2\rceil$ linear forests, where a linear forest is a collection of vertex-disjoint paths. Although …

    oxford Repository record for Putting the pieces together: from graph decompositions to Ramsey theory (opens in a new tab)