On the minimal number of separating 3-cycles in non-hamiltonian maximal planar graphs

In: Tatra Mountains Mathematical Publications, vol. 9, no. 3

Thomas Böhme - Jochen Harant - Michal Tkáč

Detaily:

Rok, strany: 1996, 97 - 102

O článku:

A well known theorem of H. Whitney states that every maximal planar graph without separating 3-cycles is Hamiltonian. The problem discussed here is how many separating 3-cycles such a graph must have to be non-Hamiltonian.

Ako citovať:

ISO 690:

Böhme, T., Harant, J., Tkáč, M. 1996. On the minimal number of separating 3-cycles in non-hamiltonian maximal planar graphs. In Tatra Mountains Mathematical Publications, vol. 9, no.3, pp. 97-102. 1210-3195.

APA:

Böhme, T., Harant, J., Tkáč, M. (1996). On the minimal number of separating 3-cycles in non-hamiltonian maximal planar graphs. Tatra Mountains Mathematical Publications, 9(3), 97-102. 1210-3195.