This paper examines simple operations by which the cubic graphs with a given connectedness on p points can be constructed from those on less than p points. In particular, for cyclically 4-connected cubic graphs, the only operation required is that of joining the midpoints of two non-adjacent lines.
|Title of host publication||Combinatorial Mathematics VI|
|Subtitle of host publication||Proceedings of the Sixth Australian Conference on Combinatorial Mathematics, Armidale, Australia, August 1978|
|Editors||A F Horadam, W D Wallis|
|Place of Publication||Berlin Germany|
|Number of pages||8|
|Publication status||Published - 1979|
|Name||Lecture Notes in Mathematics|