๐”– Bobbio Scriptorium
โœฆ   LIBER   โœฆ

Chords of Twisted Cubics

โœ Scribed by Wakeford, E. K.

Book ID
120104509
Publisher
Oxford University Press
Year
1923
Tongue
English
Weight
515 KB
Volume
s2-21
Category
Article
ISSN
0024-6115

No coin nor oath required. For personal study only.

๐Ÿ“œ SIMILAR VOLUMES

Twisted cubics, bis
Twisted cubics, bis
โœ Israel Vainsencher ๐Ÿ“‚ Article ๐Ÿ“… 2001 ๐Ÿ› Springer ๐ŸŒ English โš– 364 KB
Chords of Longest Cycles in Cubic Graphs
Chords of Longest Cycles in Cubic Graphs
โœ Carsten Thomassen ๐Ÿ“‚ Article ๐Ÿ“… 1997 ๐Ÿ› Elsevier Science ๐ŸŒ English โš– 213 KB

We describe a general sufficient condition for a Hamiltonian graph to contain another Hamiltonian cycle. We apply it to prove that every longest cycle in a 3-connected cubic graph has a chord. We also verify special cases of an old conjecture of Sheehan on Hamiltonian cycles in 4-regular graphs and

Even cycles with prescribed chords in pl
Even cycles with prescribed chords in planar cubic graphs
โœ Herbert Fleischner ๐Ÿ“‚ Article ๐Ÿ“… 1983 ๐Ÿ› Elsevier Science ๐ŸŒ English โš– 254 KB

The following result is being proved. Theorem: Let e be an arbitrary line of the 2-connected, 3-regular, planar graph G such that e cioes not belong to any cut set of size 2. Then G contains an even cycle for which e is a chord.