Partitionability of trees

DOI10.21136/CMJ.1988.102263MaRDI QIDQ3824323zbMATH OpenOpenAlexFDO

Authors Bohdan Zelinka

Publication date 1988

Full work available at URL https://eudml.org/doc/13741

zbMATH Keywords

k-partitionabilityspanning tree

Mathematics Subject Classification ID

Trees (05C05) Connectivity (05C40)

Recommendations

• On tree partitions
• Partitions of Graphs into Trees
• On the partition dimension of trees
• On tree-partitions of graphs
• Partition complexes and trees
• Partitions and labeled trees
• Representing partitions on trees
• A canonical partition theorem for trees

Cited in

(16)

• Aronszajn trees and partitions
• On a tree-cutting problem of P. Ash
• On trees and noncrossing partitions
• On different ``middle parts of a tree
• Constrained domatic bipartition on trees
• A note on balance vertices in trees
• Partitioning a weighted tree into subtrees with weights in a given range
• On tree partitions
• Large discrete parts of the E-tree
• scientific article; zbMATH DE number 19193 (Why is no real title available?)
• scientific article; zbMATH DE number 36198 (Why is no real title available?)
• scientific article; zbMATH DE number 2065939 (Why is no real title available?)
• TREE STRUCTURES ON CERTAIN FAMILIES OF PARTITIONS
• Determination of large families and diameter of equiseparable trees
• Hypertrees, rooted trees and pointed partitions
• Pairs of trees in tree--tree triangulations

This page was built for publication: Partitionability of trees

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