𝔖 Bobbio Scriptorium
✦   LIBER   ✦

Augmented canonical forms and factorization of graphs

✍ Scribed by A. Kaveh; M. A. Sayarinejad

Publisher
John Wiley and Sons
Year
2006
Tongue
English
Weight
136 KB
Volume
65
Category
Article
ISSN
0029-5981

No coin nor oath required. For personal study only.

πŸ“œ SIMILAR VOLUMES

Almost-regular factorization of graphs
Almost-regular factorization of graphs
✍ Jin Akiyama; Mikio Kano πŸ“‚ Article πŸ“… 1985 πŸ› John Wiley and Sons 🌐 English βš– 238 KB

For integers a and b, 0 s a s b, an [a,bl-graph G satisfies a s deg(x,G) s b for every vertex x of G, and an [a.bl-factor is a spanning subgraph its edges can be decomposed into [a,bl-factors. When both k and tare positive integers and s is a nonnegative integer, w e prove that every [(12k + 2)t +

A 1-factorization of the line graphs of
A 1-factorization of the line graphs of complete graphs
✍ Brian Alspach πŸ“‚ Article πŸ“… 1982 πŸ› John Wiley and Sons 🌐 English βš– 254 KB πŸ‘ 1 views

## Abstract A 1‐factorization is constructed for the line graph of the complete graph __K~n~__ when __n__ is congruent to 0 or 1 modulo 4.

Factorization of regular multigraphs int
Factorization of regular multigraphs into regular graphs
✍ S. I. El-Zanati; M. J. Plantholt; S. K. Tipnis πŸ“‚ Article πŸ“… 1995 πŸ› John Wiley and Sons 🌐 English βš– 618 KB

## Abstract A regular multigraph with maximum multiplicity __r__ and degree __rs__ cannot always be factored into __r s__‐regular simple graphs. It is shown, however, that under general conditions a similar factorization can be achieved if we first allow the addition or deletion of a relatively sma