𝔖 Bobbio Scriptorium
✦   LIBER   ✦

Edge-transitive planar graphs

✍ Scribed by Branko Grünbaum; G. C. Shephard

Publisher
John Wiley and Sons
Year
1987
Tongue
English
Weight
590 KB
Volume
11
Category
Article
ISSN
0364-9024

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

Classification of edge-transitive rose w
Classification of edge-transitive rose window graphs
✍ István Kovács; Klavdija Kutnar; Dragan Marušič 📂 Article 📅 2010 🏛 John Wiley and Sons 🌐 English ⚖ 177 KB

## Abstract Given natural numbers __n__⩾3 and 1⩽__a__, __r__⩽__n__−1, the __rose window graph R__~__n__~(__a, r__) is a quartic graph with vertex set \documentclass{article}\usepackage{amssymb}\usepackage{amsbsy}\usepackage[mathscr]{euscript}\footskip=0pc\pagestyle{empty}\begin{document}$\{{{x}}\_{

Tetravalent half-edge-transitive graphs
Tetravalent half-edge-transitive graphs and non-normal Cayley graphs
✍ Xiuyun Wang; Yan-Quan Feng 📂 Article 📅 2011 🏛 John Wiley and Sons 🌐 English ⚖ 206 KB

Let X be a vertex-transitive graph, that is, the automorphism group Aut(X ) of X is transitive on the vertex set of X . The graph X is said to be symmetric if Aut(X ) is transitive on the arc set of X . Suppose that Aut(X ) has two orbits of the same length on the arc set of X . Then X is said to be

Edge-reconstruction of 4-connected plana
Edge-reconstruction of 4-connected planar graphs
✍ S. Fiorini; J. Lauri 📂 Article 📅 1982 🏛 John Wiley and Sons 🌐 English ⚖ 482 KB 👁 2 views

## Abstract The object of this paper is to show that 4‐connected planar graphs are uniquely determined from their collection of edge‐deleted subgraphs.

Semi-transitive graphs
Semi-transitive graphs
✍ Steve Wilson 📂 Article 📅 2003 🏛 John Wiley and Sons 🌐 English ⚖ 284 KB

## Abstract In this paper, we first consider graphs allowing symmetry groups which act transitively on edges but not on darts (directed edges). We see that there are two ways in which this can happen and we introduce the terms __bi‐transitive__ and __semi‐transitive__ to describe them. We examine t

On edge transitivity of directed graphs
On edge transitivity of directed graphs
✍ Jayme L. Szwarcfiter 📂 Article 📅 1995 🏛 Elsevier Science 🌐 English ⚖ 476 KB

We examine edge transitivity of directed graphs. The class of local comparability graphs is defined as the underlying graphs of locally edge transitive digraphs. The latter generalize edge transitive orientations, while local comparability graphs include comparability, anticomparability, and circle