𝔖 Bobbio Scriptorium
✦   LIBER   ✦

On the number of 1-factors of locally finite graphs

✍ Scribed by François Bry

Publisher
Elsevier Science
Year
1983
Tongue
English
Weight
477 KB
Volume
34
Category
Article
ISSN
0095-8956

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

On bounded automorphisms of locally fini
On bounded automorphisms of locally finite transitive graphs
✍ Niemeyer, Peter 📂 Article 📅 1996 🏛 John Wiley and Sons 🌐 English ⚖ 517 KB

The automorphism-group of an infinite graph acts in a natural way on the set of d-fibers (components of the set of rays with respect to the Hausdorff metric). For connected, locally finite, almost transitive graphs the kernel of this action is proved to be the group of bounded automorphisms. This co

On the hamiltonicity of line graphs of l
On the hamiltonicity of line graphs of locally finite, 6-edge-connected graphs
✍ Richard C. Brewster; Daryl Funk 📂 Article 📅 2011 🏛 John Wiley and Sons 🌐 English ⚖ 124 KB

## Abstract The topological approach to the study of infinite graphs of Diestel and KÜhn has enabled several results on Hamilton cycles in finite graphs to be extended to locally finite graphs. We consider the result that the line graph of a finite 4‐edge‐connected graph is hamiltonian. We prove a

On the number of (r,r+1)- factors in an
On the number of (r,r+1)- factors in an (r,r+1)-factorization of a simple graph
✍ A. J. W. Hilton 📂 Article 📅 2009 🏛 John Wiley and Sons 🌐 English ⚖ 113 KB 👁 1 views

## Abstract For integers __d__≥0, __s__≥0, a (__d, d__+__s__)‐__graph__ is a graph in which the degrees of all the vertices lie in the set {__d, d__+1, …, __d__+__s__}. For an integer __r__≥0, an (__r, r__+1)‐__factor__ of a graph __G__ is a spanning (__r, r__+1)‐subgraph of __G__. An (__r, r__+1)‐