𝔖 Bobbio Scriptorium
✦   LIBER   ✦

The Hadwiger number of infinite vertex-transitive graphs

✍ Scribed by Carsten Thomassen


Publisher
Springer-Verlag
Year
1992
Tongue
English
Weight
679 KB
Volume
12
Category
Article
ISSN
0209-9683

No coin nor oath required. For personal study only.


πŸ“œ SIMILAR VOLUMES


An infinite series of regular edge- but
✍ Felix Lazebnik; Raymond Viglione πŸ“‚ Article πŸ“… 2002 πŸ› John Wiley and Sons 🌐 English βš– 91 KB πŸ‘ 1 views

## Abstract Let __n__ be an integer and __q__ be a prime power. Then for any 3 ≀ __n__ ≀ __q__βˆ’1, or __n__=2 and __q__ odd, we construct a connected __q__‐regular edge‐but not vertex‐transitive graph of order 2__q__^__n__+1^. This graph is defined via a system of equations over the finite field of

The maximum genus of vertex-transitive g
✍ Martin Ε koviera; Roman Nedela πŸ“‚ Article πŸ“… 1989 πŸ› Elsevier Science 🌐 English βš– 911 KB

The maximum genus of all vertex-transitive graphs is computed. It is proved that a k-valent vertex-transitive graph of girth g is upper-embeddable whenever k 3 4 or g 2 4. Non-upper-embeddable vertex-transitive graphs are characterized. A particular attention is paid to Cayley graphs. Groups for wh

Vertex-transitive graphs: Symmetric grap
✍ Peter Lorimer πŸ“‚ Article πŸ“… 1984 πŸ› John Wiley and Sons 🌐 English βš– 642 KB

Let G be a group acting symmetrically on a graph 2, let G, be a subgroup of G minimal among those that act symmetrically on 8, and let G2 be a subgroup of G, maximal among those normal subgroups of GI which contain no member except 1 which fixes a vertex of Z. The most precise result of this paper i