Global ETD Search
Search theses and dissertations gathered from participating repositories worldwide. Every result links back to the library that holds it. No account is needed.
Results
Showing 1 to 2 of 2 for “"separating triangle"”.
-
Hamiltonian cycles in maximal planar graphs and planar triangulations
… proved that any maximal planar graph without a separating triangle is Hamiltonian, where a separating triangle is a triangle such that its removal disconnects the graph. Chen then extended Whitney's results and allowed for one separating triangle and showed that the graph is still Hamiltonian. …
-
Hamiltonicity of maximal planar graphs and planar triangulations
… that every maximal planar graph with at most k separating triangles is hamiltonian? An analysis of the structure shows a special structure of the position of the separating triangles to each other, which will also generate hamiltonicity. Moreover, this part deals with the question how many …