Add to ORKGEvery finite, self-dual, regular (or chiral) 4-polytope of type {3, q, 3} has a trivalent 3-transitive (or 2-transitive) medial layer graph. Here, by dropping self-duality, we obtain a construction for semisymmetric trivalent graphs (which are edge- but not vertex-transitive). In particular, the Gray graph arises as the medial layer graph of a certain universal locally toroidal regular 4-polytope
We investigate the possibility of forming achiral knottings of polyhedral (3-connected) graphs whose...
A graph is self-complementary if it is isomorphic to its complement. A graph is vertex transitive if...
A graph is self-complementary if it is isomorphic to its complement. A graph is vert...
AbstractEvery finite, self-dual, regular (or chiral) 4-polytope of type {3,q,3} has a trivalent 3-tr...
AbstractIn any abstract 4-polytope P, the faces of ranks 1 and 2 constitute, in a natural way, the v...
The Gray graph is the smallest trivalent semisymmetric graph; it has 54 vertices. We present three d...
Previously we have investigated the medial layer graph G for a finite, self-dual, regular or chiral ...
Previously we have investigated the medial layer graph G for a finite, self-dual, regular or chiral ...
Given a polytope P of rank 2n, the faces of middle ranks n - 1 and n constitute the vertices of a bi...
A simple undirected graph is said to be semisymmetric if it is regular and edge-transitive but not v...
Abstract. A regular graph Γ is said to be semisymmetric if its full automorphism group acts transiti...
The Four Color Theorem is equivalent with its dual form stating that each 2-edge-connected 3-regular...
AbstractA regular edge-transitive graph is said to be semisymmetric if it is not vertex-transitive. ...
We investigate the possibility of forming achiral knottings of polyhedral (3-connected) graphs whose...
AbstractIn a previous paper we constructed a finite regular (abstract) 4-polytope of type {3,3,p} fo...
We investigate the possibility of forming achiral knottings of polyhedral (3-connected) graphs whose...
A graph is self-complementary if it is isomorphic to its complement. A graph is vertex transitive if...
A graph is self-complementary if it is isomorphic to its complement. A graph is vert...
AbstractEvery finite, self-dual, regular (or chiral) 4-polytope of type {3,q,3} has a trivalent 3-tr...
AbstractIn any abstract 4-polytope P, the faces of ranks 1 and 2 constitute, in a natural way, the v...
The Gray graph is the smallest trivalent semisymmetric graph; it has 54 vertices. We present three d...
Previously we have investigated the medial layer graph G for a finite, self-dual, regular or chiral ...
Previously we have investigated the medial layer graph G for a finite, self-dual, regular or chiral ...
Given a polytope P of rank 2n, the faces of middle ranks n - 1 and n constitute the vertices of a bi...
A simple undirected graph is said to be semisymmetric if it is regular and edge-transitive but not v...
Abstract. A regular graph Γ is said to be semisymmetric if its full automorphism group acts transiti...
The Four Color Theorem is equivalent with its dual form stating that each 2-edge-connected 3-regular...
AbstractA regular edge-transitive graph is said to be semisymmetric if it is not vertex-transitive. ...
We investigate the possibility of forming achiral knottings of polyhedral (3-connected) graphs whose...
AbstractIn a previous paper we constructed a finite regular (abstract) 4-polytope of type {3,3,p} fo...
We investigate the possibility of forming achiral knottings of polyhedral (3-connected) graphs whose...
A graph is self-complementary if it is isomorphic to its complement. A graph is vertex transitive if...
A graph is self-complementary if it is isomorphic to its complement. A graph is vert...