On the tree number of regular graphs
A collection of edge-disjoint subtrees of a graph \(G\) that cover all edges of \(G\) is called a tree decomposition of \(G\). The tree number of \(G\), \(\tau(G)\), is the minimum number of trees in a tree decomposition of \(G\). The paper has two main results. The first of them states that the tree number of a \(d\)-regular graph, such that \(d\) is even and the edge-connectivity of \(G\) equals \(d\), is equal to \(d/2\) (which is also equal to the arboricity of \(G\)). The second main result shows that for every odd \(d\), there is a sequence of \(d\)-regular graphs \(G_n\) each with edge-connectivity \(d\) and such that \(\tau(G_n)\geq|V(G_n)|/2d\).
- The number of spanning trees in regular graphs
- scientific article; zbMATH DE number 2044920
- On nth order degree regular trees
- On the tree cover number of a graph
- Counting trees in directed regular multigraphs
- The forest number in several classes of regular graphs
- On the total domatic number of regular graphs
- On the chromatic number of tree graphs
- scientific article; zbMATH DE number 5003360
- The number of spanning trees of the regular networks
- Decomposition of Finite Graphs Into Forests
- scientific article; zbMATH DE number 3547328 (Why is no real title available?)
- On partitions of graphs into trees
- Orienting planar graphs
- Planar graphs and poset dimension
- The tree number of a graph with a given girth
- Two trees in maximal planar bipartite graphs
This page was built for publication: On the tree number of regular graphs
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1356782)
