Cycles through ten vertices in 3-connected cubic graphs - researchr publication related

researchr

You are not signed in
Sign in
Sign up

Mark N. Ellingham, Derek A. Holton, Charles H. C. Little. Cycles through ten vertices in 3-connected cubic graphs. Combinatorica, 4(4):265-273, 1984.

The following publications are possibly variants of this publication:

Cycles Through 23 Vertices in 3-Connected Cubic Planar GraphsRobert E. L. Aldred, Sheng Bau, Derek A. Holton, Brendan D. McKay. gc, 15(4):373-376, 1999. [doi]

Cycles containing 12 vertices in 3-connected cubic graphsSheng Bau, Derek A. Holton. jgt, 15(4):421-429, 1991. [doi]

Cycles through five edges in 3-connected cubic graphsRobert E. L. Aldred, Derek A. Holton. gc, 3(1):299-311, 1987. [doi]

Cycles through four edges in 3-connected cubic graphsRobert E. L. Aldred, Derek A. Holton, Carsten Thomassen. gc, 1(1):7-11, 1985. [doi]

Hamiltonian cycles in cubic 3-connected bipartite planar graphsDerek A. Holton, Bennet Manvel, Brendan D. McKay. JCT, 38(3):279-297, 1985. [doi]

runs on WebDSL