Transformations of cubic graphs

Abstract For simple r-regular graph, an edge-reduction and three transformations ( S - , X - , and H - transformations ) are defined which preserve the regularity. In the case r = 3, relations between them are discussed and it is proved that for any two connected cubic graphs with the same order one is obtained from the other by a finite sequence of S - transformations . Then it defines a metric on the set of connected cubic graphs.

[1]  O. Ore The Four-Color Problem , 1967 .

[2]  R. Guy,et al.  On the Möbius Ladders , 1967, Canadian Mathematical Bulletin.

[3]  Paul D. Seymour,et al.  Graph minors. I. Excluding a forest , 1983, J. Comb. Theory, Ser. B.

[4]  Properties of a planar cubic graph , 1973 .