✦ LIBER ✦

Relations (graphs) with given infinite semigroups

✍ Scribed by A. Pultr; Z. Hedrlín

Publisher: Springer Vienna
Year: 1964
Tongue: English
Weight: 227 KB
Volume: 68
Category: Article
ISSN: 0026-9255
DOI: 10.1007/bf01304185

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

Symmetric relations (undirected graphs)

Symmetric relations (undirected graphs) with given semigroups

✍ Z. Hedrlín; A. Pultr 📂 Article 📅 1965 🏛 Springer Vienna 🌐 English ⚖ 208 KB

Relations (graphs) with given finitely g

Relations (graphs) with given finitely generated semigroups

✍ Z. Hedrlín; A. Pultr 📂 Article 📅 1964 🏛 Springer Vienna 🌐 English ⚖ 200 KB

Graphs with given infinite group

✍ Gert Sabidussi 📂 Article 📅 1960 🏛 Springer Vienna 🌐 English ⚖ 163 KB

On the minimum order of graphs with give

On the minimum order of graphs with given semigroup

✍ Václav Koubek; Vojtěch Rödl 📂 Article 📅 1984 🏛 Elsevier Science 🌐 English ⚖ 1013 KB

Infinite families of crossing-critical g

Infinite families of crossing-critical graphs with a given crossing number

✍ Jozef Širáň 📂 Article 📅 1984 🏛 Elsevier Science 🌐 English ⚖ 192 KB

Graphs with given group and given consta

Graphs with given group and given constant link

✍ Walter Vogler 📂 Article 📅 1984 🏛 John Wiley and Sons 🌐 English ⚖ 228 KB

## Abstract __A__ graph __L__ is called a link graph if there is a graph __G__ such that for each vertex of __G__ its neighbors induce a subgraph isomorphic to __L.__ Such a G is said to have constant link __.__L Sabidussi proved that for any finite group F and any __n__ ⩾ 3 there are infinitely ma