This paper presents a phenomenon which sometimes occurs in tetravalent bipartite locally dart-transitive graphs, called a Base Graph -- Connection Graph dissection. In this dissection, each white vertex is split into two vertices of valence 2 so that the connected components of the result are isomorphic. Given the Base Graph whose subdivision is isomorphic to each component, and the Connection Graph, which describes how the components overlap, we can, in some cases, provide a construction which can make a graph having such a decomposition. This paper investigates the general phenomenon as well as the special cases in which the connection graph has no more than one edge.

中文翻译：

---

基图-连接图：解剖和构造

本文提出了一种有时出现在四价二分局部 dart-传递图中的现象，称为基础图 - 连接图解剖。在这个剖析中，每个白色顶点被分成两个价为 2 的顶点，因此结果的连通分量是同构的。给定其细分与每个组件同构的基本图，以及描述组件如何重叠的连接图，在某些情况下，我们可以提供一种构造，使图具有这种分解。本文研究了一般现象以及连接图只有一条边的特殊情况。