Skip to main content

All Questions

Filter by
Sorted by
Tagged with
5 votes
1 answer
119 views

Sufficient condition for a Hamilton cycle C in a planar triangulation G s.t. every triangle in G has an edge in C

Let G be a k-connected planar triangulation (k4) and let C be a Hamilton cycle of G. Then: Which conditions would be sufficient to assure that every triangle of G has at least one ...
Jose Antonio Martin H's user avatar
2 votes
1 answer
138 views

Two ears polygon in a maximal planar hamiltonian graph

Given a maximal planar graph (+6vertices) without separating triangles. Then it can have many Hamilton cycles°. Such a cycle divides the graph into two triangulated polygons. Is it always possible to ...
P.Labarque's user avatar