๐”– Bobbio Scriptorium
โœฆ   LIBER   โœฆ

Circuit partitioning with size and connection constraints

โœ Scribed by Yehoshua Perl; Marc Snir

Publisher
John Wiley and Sons
Year
1983
Tongue
English
Weight
534 KB
Volume
13
Category
Article
ISSN
0028-3045

No coin nor oath required. For personal study only.

๐Ÿ“œ SIMILAR VOLUMES

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