Hamiltonicity of planar cubic multigraphs

Authors:
Zdzislaw Skupien
Affiliations:
Faculty of Applied Mathematics, University of Mining and Metallurgy AGH, al. Mickiewicza 30, 30-059 Kraków, Poland
Venue:
Discrete Mathematics
Year:
2002

Citing 2
Cited 0

Graphs & digraphs (2nd ed.)

Graphs & digraphs (2nd ed.)
A note on the vertex arboricity of a graph

SIAM Journal on Discrete Mathematics

Quantified Score

Hi-index	0.05

Visualization

Abstract

Hamiltonicity of connected cubic planar general graphs G is characterized in terms of partitioning any dual graph G* into two trees. Thus tree-tree triangulations become involved. The related Stein theorem is corrected and extended. Moreover, it follows that a maximal planar graph G can be partitioned into two forests if and only if G can be partitioned into two trees.