On the minimal packing of a tree with fixed vertices

DOI10.1515/DMA.1997.7.2.157zbMATH Open0899.68053OpenAlexW2093927660MaRDI QIDQ4367628FDOQ4367628

Authors: E. E. Egorov 

Publication date: 28 January 1998

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

Full work available at URL: https://doi.org/10.1515/dma.1997.7.2.157

Recommendations

• Complexity of the Packing Coloring Problem for Trees
• On the tree packing problem
• Packing and covering a tree by subtrees
• Complexity of the packing coloring problem for trees

zbMATH Keywords

minimal packing

Mathematics Subject Classification ID

Trees (05C05) Analysis of algorithms and problem complexity (68Q25) Edge subsets with special properties (factorization, matching, partitioning, covering and packing, etc.) (05C70)

Cited In (6)

• An approximate version of the tree packing conjecture
• On cyclic packing of a tree
• Packing and covering a tree by subtrees
• On the complexity of a linear ordering of weighted directed acyclic graphs
• Non-preemptive tree packing
• Maximum tree-packing in time O(n5/2)

This page was built for publication: On the minimal packing of a tree with fixed vertices

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4367628)