𝔖 Bobbio Scriptorium
✦   LIBER   ✦

Decomposition of infinite eulerian graphs with a small number of vertices of infinite degree

✍ Scribed by François Laviolette

Publisher
Elsevier Science
Year
1994
Tongue
English
Weight
280 KB
Volume
130
Category
Article
ISSN
0012-365X

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

Infinite families of crossing-critical g
Infinite families of crossing-critical graphs with prescribed average degree and crossing number
✍ Drago Bokal 📂 Article 📅 2010 🏛 John Wiley and Sons 🌐 English ⚖ 242 KB 👁 1 views

## Abstract Širáň constructed infinite families of __k__‐crossing‐critical graphs for every __k__⩾3 and Kochol constructed such families of simple graphs for every __k__⩾2. Richter and Thomassen argued that, for any given __k__⩾1 and __r__⩾6, there are only finitely many simple __k__‐crossing‐criti

Reconstructing the degree sequence and t
Reconstructing the degree sequence and the number of components of an infinite graph
✍ Thomas Andreae 📂 Article 📅 1982 🏛 Elsevier Science 🌐 English ⚖ 812 KB

We prove that the degree sequence of an infinite graph is reconstructibjle from its family of vertex-deleted subgraphs. Furthermore, as another result concerning the reconstruction of infinite graphs, we prove that the number c(G) of components of an infinite graph G is re~ons~uct~b~e if there is at

On the factorization of graphs with exac
On the factorization of graphs with exactly one vertex of infinite degree
✍ François Bry 📂 Article 📅 1983 🏛 Elsevier Science 🌐 English ⚖ 355 KB

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

Note on the reconstruction of infinite g
Note on the reconstruction of infinite graphs with a fixed finite number of components
✍ Thomas Andreae 📂 Article 📅 1982 🏛 John Wiley and Sons 🌐 English ⚖ 169 KB 👁 1 views

For every positive integer c , we construct a pair G, , H, of infinite, nonisomorphic graphs both having exactly c components such that G, and H, are hypomorphic, i.e., G, and H, have the same families of vertex-deleted subgraphs. This solves a problem of Bondy and Hemminger. Furthermore, the pair G