On tree partitions
From MaRDI portal
Recommendations
Cited in
(21)- Aronszajn trees and partitions
- On a tree-cutting problem of P. Ash
- Splitting trees
- On trees and noncrossing partitions
- On different ``middle parts of a tree
- Block-cutvertex trees and block-cutvertex partitions
- Balanced partitions of trees and applications
- Partitioning a weighted tree into subtrees with weights in a given range
- Tree partitioning via vertex deletion
- Countable splitting graphs
- Further results on degree splitting graph of a graph
- Partitioning a Weighted Tree to Subtrees of Almost Uniform Size
- scientific article; zbMATH DE number 3908483 (Why is no real title available?)
- scientific article; zbMATH DE number 3957131 (Why is no real title available?)
- Large discrete parts of the E-tree
- Partitionability of trees
- scientific article; zbMATH DE number 719398 (Why is no real title available?)
- scientific article; zbMATH DE number 2065939 (Why is no real title available?)
- scientific article; zbMATH DE number 1866895 (Why is no real title available?)
- TREE STRUCTURES ON CERTAIN FAMILIES OF PARTITIONS
- The split and non-split tree \((D, C)\)-number of a graph
This page was built for publication: On tree partitions
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2744375)