On an Eberhard-type problem in cubic polyhedral graphs having petrie and Hamiltonian cycles

In: Tatra Mountains Mathematical Publications, vol. 18, no. 4

Jaroslav Ivančo - Stanislav Jendroľ

Detaily:

Rok, strany: 1999, 57 - 62

O článku:

A Hamiltonian cycle in a cubic plane graph which takes alternately left and right edges at each successive vertex is called a Petrie Hamiltonian cycle. In this note we prove a result of Eberhard type for cubic plane $3$-connected graphs having Petrie Hamiltonian cycles.

Ako citovať:

ISO 690:

Ivančo, J., Jendroľ, S. 1999. On an Eberhard-type problem in cubic polyhedral graphs having petrie and Hamiltonian cycles. In Tatra Mountains Mathematical Publications, vol. 18, no.4, pp. 57-62. 1210-3195.

APA:

Ivančo, J., Jendroľ, S. (1999). On an Eberhard-type problem in cubic polyhedral graphs having petrie and Hamiltonian cycles. Tatra Mountains Mathematical Publications, 18(4), 57-62. 1210-3195.