On the tree packing problem

DOI10.1016/0166-218X(92)90040-HzbMath0739.05072OpenAlexW2037357531MaRDI QIDQ1183337

Shigeru Masuyama

Publication date: 28 June 1992

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

Full work available at URL: https://doi.org/10.1016/0166-218x(92)90040-h

zbMATH Keywords

linear algorithmmaximum tree packing problem

Mathematics Subject Classification ID

Trees (05C05) Edge subsets with special properties (factorization, matching, partitioning, covering and packing, etc.) (05C70) Graph algorithms (graph-theoretic aspects) (05C85)

Related Items (1)

On the tree packing problem

Cites Work

• Unnamed Item
• Packings by cliques and by finite families of graphs
• On generalized matching problems
• Packing subgraphs in a graph
• On the tree packing problem
• Parallel concepts in graph theory
• On the Complexity of General Graph Factor Problems
• Packings by Complete Bipartite Graphs
• Covering Points of a Digraph with Point-Disjoint Paths and Its Application to Code Optimization
• The Factorization of Linear Graphs

This page was built for publication: On the tree packing problem