Opening book details…
Can I read On certain Hamiltonian cycles in planar graphs on EtoBox?
On certain Hamiltonian cycles in planar graphs by T. Bhme; J. Harant; M. Tk? is a Computer Science article available to read on EtoBox.
What is On certain Hamiltonian cycles in planar graphs about?
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 must be present in a 5-connected graph that is embedded into the plane or into the projective plane with face-width at least five. Especially, we show that every 5-connected plane or projective plane triangulation on n vertices with no non-contractible cyles of length less than five contains at least 2 O(n 1/4 ) distinct Hamiltonian cycles.
Who reads On certain Hamiltonian cycles in planar graphs?
It is typically read by researchers, students, and practitioners in Computer Science.
- Author
- T. Bhme; J. Harant; M. Tk?
- Publisher
- John Wiley and Sons; Wiley (John Wiley & Sons); John Wiley & Sons Inc.; Wiley (ISSN 0364-9024)
- Published
- 1999
- Language
- EN
- Field
- Computer Science (Physical Sciences)