Congruent Graphs and the Connectivity of Graphs
Congruent Graphs and the Connectivity of Graphs
复制标题
DOI：
10.1007/978-1-4612-2972-8_4
复制
发表时间：
1932
影响因子：
1.7
通讯作者：
H. Whitney
中科院分区：
文献类型：
--
作者：
H. Whitney
给出了两个图同余的条件和关于图的连通性的几个定理，并给出了对偶图的一些应用。最后这些定理也可以用拓扑学方法来证明。作者关于“不可分和平面图”的一篇论文的定义和结果，†将经常被使用。为方便起见，我们称这篇文章为N。如果两条弧有一个公共顶点，我们称它们相接。
We give here conditions that two graphs be congruent and some theorems on the connectivity of graphs, and we conclude with some applications to dual graphs. These last theorems might also be proved by topological methods. The definitions and results of a paper by the author on “Non-separable and planar graphs,” † will be made use of constantly. We shall refer to this paper as N. For convenience, we shall say two arcs touch if they have a common vertex.