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

Partitioning regular graphs into equicardinal linear forests

โœ Scribed by R.E.L. Aldred; Bill Jackson; Dingjun Lou; Akira Saito

Publisher
Elsevier Science
Year
1991
Tongue
English
Weight
521 KB
Volume
88
Category
Article
ISSN
0012-365X

No coin nor oath required. For personal study only.

โœฆ Synopsis

components are paths.

๐Ÿ“œ SIMILAR VOLUMES

Factorisation of regular graphs into for
Factorisation of regular graphs into forests of short paths
โœ Terri Lindquester; Nicholas C. Wormald ๐Ÿ“‚ Article ๐Ÿ“… 1998 ๐Ÿ› Elsevier Science ๐ŸŒ English โš– 454 KB

The k-linear arboricity of a graph G is the minimum number of forests whose connected components are paths of length at most k which partition E(G). Motivated by this index, we investigate a variation of this idea for d-regular graphs. Namely, we define a d-regular graph G to be (l,k)-linear arborif

Simple planar graph partition into three
Simple planar graph partition into three forests
โœ Roberto Grossi; Elena Lodi ๐Ÿ“‚ Article ๐Ÿ“… 1998 ๐Ÿ› Elsevier Science ๐ŸŒ English โš– 796 KB

We describe a simple way of partitioning a planar graph into three edge-disjoint forests in O(n log n) time, where n is the number of its vertices. We can use this partition in Kannan et al.'s graph representation (1992) to label the planar graph vertices so that any two vertices' adjacency can be t

Partition of odd regular graphs into bis
Partition of odd regular graphs into bistars
โœ Francois Jaeger; Charles Payan; Mekkia Kouider ๐Ÿ“‚ Article ๐Ÿ“… 1983 ๐Ÿ› Elsevier Science ๐ŸŒ English โš– 84 KB