✦ LIBER ✦

Convex tree realizations of partitions

✍ Scribed by Andreas Dress; Michael Steel

Publisher: Elsevier Science
Year: 1992
Tongue: English
Weight: 326 KB
Volume: 5
Category: Article
ISSN: 0893-9659
DOI: 10.1016/0893-9659(92)90026-6

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

Transitive partitions in realizations of

Transitive partitions in realizations of tournament score sequences

✍ Arthur H. Busch; Guantao Chen; Michael S. Jacobson 📂 Article 📅 2009 🏛 John Wiley and Sons 🌐 English ⚖ 121 KB

## Abstract A tournament is an oriented complete graph, and one containing no directed cycles is called __transitive__. A tournament __T__=(__V, A__) is called __m__‐__partition transitive__ if there is a partition such that the subtournaments induced by each __X__~__i__~ are all transitive, an

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

Convex partitions of a finite lattice

✍ Scott R. Sykes 📂 Article 📅 2007 🏛 Springer 🌐 English ⚖ 106 KB

Convex and extendable partitions of a la

Convex and extendable partitions of a lattice

✍ Scott R. Sykes 📂 Article 📅 1999 🏛 Elsevier Science 🌐 English ⚖ 819 KB

Balanced Convex Partitions of Measures i

Balanced Convex Partitions of Measures in ℝ2

✍ Toshinori Sakai 📂 Article 📅 2002 🏛 Springer Japan 🌐 English ⚖ 312 KB

Convex labelings of trees

✍ Stephen J. Dow; Douglas F. Rall; Peter J. Slater 📂 Article 📅 1987 🏛 John Wiley and Sons 🌐 English ⚖ 456 KB

A convex labeling of a tree T o f order n is a one-to-one function f from the vertex set of Tinto the nonnegative integers, so that f ( y ) 5 ( f ( x ) t f(z))/2 for every path x, y, z of length 2 in T. If, in addition, f (v) I n -1 for every vertex v of T, then f is a perfect convex labeling and T