𝔖 Bobbio Scriptorium
✦   LIBER   ✦

On the factorization of graphs with exactly one vertex of infinite degree

✍ Scribed by François Bry

Publisher
Elsevier Science
Year
1983
Tongue
English
Weight
355 KB
Volume
43
Category
Article
ISSN
0012-365X

No coin nor oath required. For personal study only.

✦ Synopsis

We give a necessary and suflicient exactly one vertex of infinite degree. condition for the existence of a l-factor in graphs with

1. Illmmdon

The following well-known necessary and sufficient condition for the existence of a l-factor in locally

📜 SIMILAR VOLUMES

Note on vertex-partitions of infinite gr
Note on vertex-partitions of infinite graphs
✍ János Pach; Joel H. Spencer 📂 Article 📅 1990 🏛 Elsevier Science 🌐 English ⚖ 118 KB

Given an infinite graph G, let deg,(G) be defined as the smallest d for which V(G) can be partitioned into finite subsets of (uniformly) bounded size such that each part is adjacent to at most d others. A countable graph G is constructed with de&(G) > 2 and with the property that [{y~V(G):d(x, y)sn}

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

One-factorizations of complete graphs wi
One-factorizations of complete graphs with vertex-regular automorphism groups
✍ Arrigo Bonisoli; Domenico Labbate 📂 Article 📅 2001 🏛 John Wiley and Sons 🌐 English ⚖ 161 KB

## Abstract We consider one‐factorizations of __K__~2__n__~ possessing an automorphism group acting regularly (sharply transitively) on vertices. We present some upper bounds on the number of one‐factors which are fixed by the group; further information is obtained when equality holds in these boun

On the girth of infinite graphs
On the girth of infinite graphs
✍ Norbert Seifter 📂 Article 📅 1993 🏛 Elsevier Science 🌐 English ⚖ 599 KB

Let X be an infinite k-valent graph with polynomial growth of degree d, i.e. there is an integer d and a constant c such that fx(n) 3, d> 1, 123, there exist k-valent connected graphs with polynomial growth of degree d and girth greater than 1. This means that in general the girth of graphs with pol