Minimum degree and minimum number of edge-disjoint trees

DOI10.1016/S0012-365X(03)00108-0zbMath1030.05097OpenAlexW1993788256MaRDI QIDQ1420598

Anna S. Lladó, Susana-Clara López

Publication date: 2 February 2004

Published in: Discrete Mathematics (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/s0012-365x(03)00108-0

zbMATH Keywords

TreesArboricityEdge-partition

Mathematics Subject Classification ID

Trees (05C05) Extremal problems in graph theory (05C35) Edge subsets with special properties (factorization, matching, partitioning, covering and packing, etc.) (05C70)

Cites Work

• The tree number of a graph with a given girth
• Orienting planar graphs
• On partitions of graphs into trees
• On the tree number of regular graphs
• Packing and decomposition of graphs with trees
• Higher edge-connectivities and tree decompositions in regular graphs
• Graph-theoretic parameters concerning domination, independence, and irredundance
• Two trees in maximal planar bipartite graphs
• Decomposition of Finite Graphs Into Forests

This page was built for publication: Minimum degree and minimum number of edge-disjoint trees