𝔖 Bobbio Scriptorium
✦   LIBER   ✦

Weak partition properties on trees

✍ Scribed by Michael Hrušák, Petr Simon, Ondřej Zindulka

Book ID
120739127
Publisher
Springer
Year
2013
Tongue
English
Weight
326 KB
Volume
52
Category
Article
ISSN
0933-5846

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

On the partition dimension of trees
On the partition dimension of trees
✍ Rodríguez-Velázquez, Juan A.; González Yero, Ismael; Lemańska, Magdalena 📂 Article 📅 2014 🏛 Elsevier Science 🌐 English ⚖ 483 KB
On trees and noncrossing partitions
On trees and noncrossing partitions
✍ Martin Klazar 📂 Article 📅 1998 🏛 Elsevier Science 🌐 English ⚖ 426 KB

We give a simple and natural proof of (an extension of) the identity P(X. 1. )I ) = t-'2( X I. I -I. II --I ). The number P(li, I, 17) counts noncrossing partitions of { I, 2. I} unto II parts such that no part contains two numbers .Y and J'. O<.v --.v<k. The lower index 2 indicate\ partitions with

On tree-partitions of graphs
On tree-partitions of graphs
✍ Guoli Ding; Bogdan Oporowski 📂 Article 📅 1996 🏛 Elsevier Science 🌐 English ⚖ 725 KB

A graph G admits a tree-partition of width k if its vertex set can be partitioned into sets of size at most k so that the graph obtained by identifying the vertices in each set of the partition, and then deleting loops and parallel edges, is a forest. In the paper, we characterize the classes of gra

On partitions of graphs into trees
On partitions of graphs into trees
✍ F.R.K. Chung 📂 Article 📅 1978 🏛 Elsevier Science 🌐 English ⚖ 934 KB

We crgnsider the minimum m\*-nber T(G) of subsets intl:, which the edge set E(G) of a graph G can lx partitioned so that each subset forms a tree. It is shown that for any connected (3 with II vertices, we always have T( Gj s [$I.