✦ LIBER ✦

A note on fragments of infinite graphs

✍ Scribed by H. A. Jung

Book ID: 110564381
Publisher: Springer-Verlag
Year: 1981
Tongue: English
Weight: 182 KB
Volume: 1
Category: Article
ISSN: 0209-9683
DOI: 10.1007/bf02579334

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

A note on infinite triangulated graphs

✍ R. Halin 📂 Article 📅 1980 🏛 Elsevier Science 🌐 English ⚖ 140 KB

A note on infinite transitive graphs

✍ Norbert Seifter 📂 Article 📅 1986 🏛 Elsevier Science 🌐 English ⚖ 250 KB

In [4] Jung and Watkins proved that for a connected infinite graph X either r®(X) = oo holds or X is a strip, if Aut(X) contains a transitive abelian subgroup G. Here we prove the same result under weaker assumptions.

A Note on Intertwines of Infinite Graphs

✍ B. Oporowski 📂 Article 📅 1993 🏛 Elsevier Science 🌐 English ⚖ 224 KB

We present a construction of two infinite graphs \(G_{1}, G_{2}\) and of an infinite set of graphs such that \(\mathscr{F}\) is an antichain with respect to the minor relation and, for every graph \(G\) in \(\mathscr{F}\), both \(G_{1}\) and \(G_{2}\) are subgraphs of \(G\) but no graph obtained fro

A note on bounded automorphisms of infin

A note on bounded automorphisms of infinite graphs

✍ Chris D. Godsil; Wilfried Imrich; Norbert Seifter; Mark E. Watkins; Wolfgang Woe 📂 Article 📅 1989 🏛 Springer Japan 🌐 English ⚖ 439 KB

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}

Note on Infinite Families of Trivalent S

Note on Infinite Families of Trivalent Semisymmetric Graphs

✍ Seymour Lipschutz; Ming-Yao Xu 📂 Article 📅 2002 🏛 Elsevier Science 🌐 English ⚖ 60 KB

A simple undirected graph is said to be semisymmetric if it is regular and edge-transitive but not vertex-transitive. This paper uses the groups PSL(2, p) and PGL(2, p), where p is a prime, to construct two new infinite families of trivalent semisymmetric graphs.