𝔖 Bobbio Scriptorium
✦   LIBER   ✦

Computational techniques for vertex partitioning of graphs

✍ Scribed by Liu, Xiaoyu; Balasubramanian, K.; Munk, M. E.

Book ID
118749482
Publisher
American Chemical Society
Year
1990
Tongue
English
Weight
804 KB
Volume
30
Category
Article
ISSN
0095-2338

No coin nor oath required. For personal study only.

πŸ“œ SIMILAR VOLUMES

Vertex partitions of chordal graphs
Vertex partitions of chordal graphs
✍ David R. Wood πŸ“‚ Article πŸ“… 2006 πŸ› John Wiley and Sons 🌐 English βš– 103 KB

## Abstract A __k‐tree__ is a chordal graph with no (__k__ + 2)‐clique. An ℓ‐__tree‐partition__ of a graph __G__ is a vertex partition of __G__ into β€˜bags,’ such that contracting each bag to a single vertex gives an ℓ‐tree (after deleting loops and replacing parallel edges by a single edge). We pro

Note on vertex-partitions of infinite gr
Note on vertex-partitions of infinite graphs
✍ JΓ‘nos Pach; Joel H. Spencer πŸ“‚ Article πŸ“… 1990 πŸ› Elsevier Science 🌐 English βš– 118 KB

Given an infinite graph G, let deg,(G) be defined as the smallest d for which V(G) can be partitioned into finite subsets of (uniformly) bounded size such that each part is adjacent to at most d others. A countable graph G is constructed with de&(G) > 2 and with the property that [{y~V(G):d(x, y)sn}

On vertex k-partitions of certain infini
On vertex k-partitions of certain infinite graphs
✍ Douglas Cenzer; Edward Howorka πŸ“‚ Article πŸ“… 1978 πŸ› Elsevier Science 🌐 English βš– 826 KB

Let G be an infinite graph; define de& G to be the least m such that any partition P of the vertex set of G into sets of uniformly bounded cardinality contains a set which is adjacent to at least m Other sets of the partition. If G is either a regular tree 01 a triangtiisr, sqzart or hexagonal plana