𝔖 Bobbio Scriptorium
✦   LIBER   ✦

On the k-path partition of graphs

✍ Scribed by George Steiner

Publisher
Elsevier Science
Year
2003
Tongue
English
Weight
150 KB
Volume
290
Category
Article
ISSN
0304-3975

No coin nor oath required. For personal study only.

πŸ“œ SIMILAR VOLUMES

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

On the characterization of path graphs
On the characterization of path graphs
✍ Huaien Li; Yixun Lin πŸ“‚ Article πŸ“… 1993 πŸ› John Wiley and Sons 🌐 English βš– 191 KB

## Abstract Broersma and Hoede have introduced path graphs. Their characterization of __P__~3~‐graphs contains a flaw. This note presents the correct form of the characterization. Β© 1993 John Wiley & Sons, Inc.