𝔖 Bobbio Scriptorium
✦   LIBER   ✦

Construction of Hamiltonian Cycles in Layered Cubic Planar Graphs

✍ Scribed by D.S. Franzblau

Publisher
Springer Japan
Year
2002
Tongue
English
Weight
362 KB
Volume
18
Category
Article
ISSN
0911-0119

No coin nor oath required. For personal study only.

πŸ“œ SIMILAR VOLUMES

On certain Hamiltonian cycles in planar
On certain Hamiltonian cycles in planar graphs
✍ BοΏ½hme, T.; Harant, J.; TkοΏ½?, M. πŸ“‚ Article πŸ“… 1999 πŸ› John Wiley and Sons 🌐 English βš– 162 KB πŸ‘ 2 views

The problem is considered under which conditions a 4-connected planar or projective planar graph has a Hamiltonian cycle containing certain prescribed edges and missing certain forbidden edges. The results are applied to obtain novel lower bounds on the number of distinct Hamiltonian cycles that mus

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.

On the Approximation of Finding A(nother
On the Approximation of Finding A(nother) Hamiltonian Cycle in Cubic Hamiltonian Graphs
✍ Cristina Bazgan; Miklos Santha; Zsolt Tuza πŸ“‚ Article πŸ“… 1999 πŸ› Elsevier Science 🌐 English βš– 144 KB

It is a simple fact that cubic Hamiltonian graphs have at least two Hamiltonian cycles. Finding such a cycle is NP-hard in general, and no polynomial-time algorithm is known for the problem of finding a second Hamiltonian cycle when one such cycle is given as part of the input. We investigate the co