Hamilton-Connectedness of Some Cubic 3-connected Plane Graph
Keywords:
Hamilton-connected, plane graphAbstract
We define a pupa graph which is a cubic 3-connected plane graph. In this paper, we show that a pupa graph is hamilton-connected if
, both k and l are even,
is odd, and
for every
.
References
Barnette D (1969) Conjecture 5. In Tutte WT (ed.) Recent Progress in Combinatorics. Academic Press, New York, pp 343
Tait PG (1884) Listing´s topologie. The London, Edinburgh, and Dublin Philosophical Magazine and Journal of Science 17: 30–46
Tutte WT(1946) On Hamiltonian circuits. Journal of the London Mathematical Society 21 : 98–101
Downloads
Published
Issue
Section
License
Copyright (c) 2025 Ramkhamhaeng International Journal of Science and Technology

This work is licensed under a Creative Commons Attribution-NonCommercial-NoDerivatives 4.0 International License.
Copyright Notice: a copyright on any article in the published journal is retained by the Ramkhamhaeng International Journal of Science and Technology. Readers or Users grant the right to use of the Article contained in the Content in accordance with the Creative Commons CC BY-NC-ND license and the Data contained in the Content in accordance with the Creative Commons CC BY-NC-ND.