𝔖 Bobbio Scriptorium
✦   LIBER   ✦

Packing Trees with Constraints on the Leaf Degree

✍ Scribed by Jácint Szabó

Publisher
Springer Japan
Year
2008
Tongue
English
Weight
206 KB
Volume
24
Category
Article
ISSN
0911-0119

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

On online bin packing with LIB constrain
On online bin packing with LIB constraints
✍ Leah Epstein 📂 Article 📅 2009 🏛 John Wiley and Sons 🌐 English ⚖ 119 KB

## Abstract In many applications of packing, the location of small items below large items, inside the packed boxes, is forbidden. We consider a variant of the classic online one‐dimensional bin packing, in which items allocated to each bin are packed there in the order of arrival, satisfying the c

Graph decomposition with constraints on
Graph decomposition with constraints on the minimum degree
✍ John Sheehan 📂 Article 📅 1988 🏛 Elsevier Science 🌐 English ⚖ 888 KB

Let G be a finite simple graph on n vertices with minimum degree 6(G) 3 6 (n = 6 (mod 2)). Let max(k, G) denote the set of all k-subsets A E V(G) such that the number of edges in the induced subgraph (A) is a maximum. We prove that for some i E (0, 1.2, . . . ). Analogous edge density constraints, r

On the tree packing problem
On the tree packing problem
✍ Shigeru Masuyama 📂 Article 📅 1992 🏛 Elsevier Science 🌐 English ⚖ 338 KB
Graph decomposition with constraints on
Graph decomposition with constraints on the connectivity and minimum degree
✍ Carsten Thomassen 📂 Article 📅 1983 🏛 John Wiley and Sons 🌐 English ⚖ 145 KB 👁 1 views

## Abstract For each pair __s,t__ of natural numbers there exist natural numbers __f(s,t)__ and __g(s,t)__ such that the vertex set of each graph of connectivity at least __f(s,t)__ (respectively minimum degree at least __g(s,t))__ has a decomposition into sets which induce subgraphs of connectivit