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

Hierarchical networks of regular degree

โœ Scribed by Stefan Boettcher; Bruno Goncalves


Publisher
Elsevier
Year
2010
Tongue
English
Weight
352 KB
Volume
6
Category
Article
ISSN
1875-3892

No coin nor oath required. For personal study only.


๐Ÿ“œ SIMILAR VOLUMES


Regular layouts of butterfly networks
โœ Jรถrg Keller ๐Ÿ“‚ Article ๐Ÿ“… 1994 ๐Ÿ› Elsevier Science ๐ŸŒ English โš– 592 KB
Factorizations of regular graphs of high
โœ A. J. W. Hilton ๐Ÿ“‚ Article ๐Ÿ“… 1985 ๐Ÿ› John Wiley and Sons ๐ŸŒ English โš– 168 KB ๐Ÿ‘ 1 views

A p-factor of a graph G is a regular spanning subgraph of degree p . For G regular of degree d ( G ) and order 2n, let ( p l , ..., p,) be a partition of d ( G ) , so that p i > 0 ( I S i S r ) and p , i i pr = d(G). If H I . ..., H, are edge-disjoint regular spanning subgraphs of G of degrees p I ,

Regular 4-critical graphs of even degree
โœ Andrey A. Dobrynin; Leonid S. Melnikov; Artem V. Pyatkin ๐Ÿ“‚ Article ๐Ÿ“… 2004 ๐Ÿ› John Wiley and Sons ๐ŸŒ English โš– 237 KB ๐Ÿ‘ 1 views

## Abstract In 1960, Dirac posed the conjecture that __r__โ€connected 4โ€critical graphs exist for every __r__ โ‰ฅ 3. In 1989, Erdล‘s conjectured that for every __r__ โ‰ฅ 3 there exist __r__โ€regular 4โ€critical graphs. In this paper, a technique of constructing __r__โ€regular __r__โ€connected vertexโ€transiti