On tree partitions

MaRDI QIDQ2744375zbMATH OpenFDO

Authors Ronald D. Dutton

Publication date 2 May 2002

Published in JCMCC. The Journal of Combinatorial Mathematics and Combinatorial Computing (Search for Journal in Brave)

zbMATH Keywords

splitting numbertreevertex partition

Mathematics Subject Classification ID

Trees (05C05)

Review text

Let \(G=(V,E)\) be a graph. Then the splitting number of \(G\) is the maximum size of \(R,R\subset V,\) so that there exists \(S\subset V\) with the property that the subgraphs induced by \(V-R\) and \(V-S\) are isomorphic. The author determines the splitting number for trees of maximum degree three having at most one vertex of degree two.

Recommendations

• Partitionability of trees
• On tree-partitions of graphs
• Representing partitions on trees
• On the partition dimension of trees
• TREE STRUCTURES ON CERTAIN FAMILIES OF PARTITIONS
• Partitions and labeled trees
• Partitions of Graphs into Trees
• On trees and noncrossing partitions

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)