Classifying k-connected cubic graphs

Nicholas C Wormald

doi:10.1007/BFb0102696

Classifying k-connected cubic graphs

Nicholas C Wormald

Research output: Chapter in Book/Report/Conference proceeding › Conference Paper › Research

Abstract

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.

Original language	English
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
Pages	199-206
Number of pages	8
Volume	748
DOIs	https://doi.org/10.1007/BFb0102696
Publication status	Published - 1979
Externally published	Yes

Publication series

Name	Lecture Notes in Mathematics
Publisher	Springer
Volume	748

Access to Document

10.1007/BFb0102696

Cite this

@inproceedings{a78efe23bfcb4d1b93e7bddb009ef8da,

title = "Classifying k-connected cubic graphs",

abstract = "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.",

author = "Wormald, \{Nicholas C\}",

year = "1979",

doi = "10.1007/BFb0102696",

language = "English",

volume = "748",

series = "Lecture Notes in Mathematics",

publisher = "Springer ",

pages = "199--206",

editor = "Horadam, \{A F\} and Wallis, \{W D\}",

booktitle = "Combinatorial Mathematics VI",

}

Classifying k-connected cubic graphs. / Wormald, Nicholas C.
Combinatorial Mathematics VI: Proceedings of the Sixth Australian Conference on Combinatorial Mathematics, Armidale, Australia, August 1978. ed. / A F Horadam; W D Wallis. Vol. 748 Berlin Germany, 1979. p. 199-206 (Lecture Notes in Mathematics; Vol. 748).

Research output: Chapter in Book/Report/Conference proceeding › Conference Paper › Research

TY - GEN

T1 - Classifying k-connected cubic graphs

AU - Wormald, Nicholas C

PY - 1979

Y1 - 1979

N2 - 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.

AB - 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.

U2 - 10.1007/BFb0102696

DO - 10.1007/BFb0102696

M3 - Conference Paper

VL - 748

T3 - Lecture Notes in Mathematics

SP - 199

EP - 206

BT - Combinatorial Mathematics VI

A2 - Horadam, A F

A2 - Wallis, W D

CY - Berlin Germany

ER -