Congruent Graphs and the Connectivity of Graphs
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.
Unable to display preview. Download preview PDF.