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 3 of 3 for “"Maximal planar graph"”.
-
Hamiltonian cycles in maximal planar graphs and planar triangulations
In this thesis we study planar graphs, in particular, maximal planar graphs and general planar triangulations. In Chapter 1 we present the terminology and notations that will be used throughout the thesis and review some elementary results on graphs that we shall need. In Chapter 2 we study the …
-
Hamiltonicity of maximal planar graphs and planar triangulations
… of hamiltonian cycles and hamiltonian paths in maximal planar graphs and planar triangulations. The first part of this dissertation focus on the question, what is the maximal number k, so that every maximal planar graph with at most k separating triangles is hamiltonian? An analysis of the …
-
Distances in planar graphs
In graph theory, the degree diameter problem asks for the maximum number of vertices a graph with given maximum degree and diameter can have. The face-degree of a face in plane graph is the length of the shortest closed walk traversing the boundary of the face. A plane graph is ρ-face-degree …