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 20 of 221 for “"Planar Graphs"”.
-
Quartic planar graphs
… we explore three problems concerning quartic planar graphs. The First is on recursive structures
-
Infinite Planar Graphs
… contain? How many bounded automorphisms does a planar graph have? Neimayer and Watkins studied these two questions and answered them for a certain class of graphs. Using the concept of excess of a vertex, the class of graphs that Neimayer and Watkins studied are extended to include graphs with …
-
Distances in planar graphs
… the results and methods of papers studying planar graphs, particularly those solving the degree diameter problem for various kinds of ρ-facedegree regular graphs. In this review, we provide a correction to an error in The degree/diameter problem in maximal planar bipartite graphs by Dalf´o, …
-
Compact Routing on Planar Graphs
… into the exploration of shortest path queries in planar graphs, with an emphasis on the utilization of space-efficient data structures. Our investigation primarily targets connected, undirected, static pointer planar graphs, focusing on scenarios where queries predominantly start or end at a …
-
The reconstruction of planar graphs
… is to investigate the Reconstruction Problem for planar graphs. This study naturally leads to related topics concerning certain nonplanar graphs and the use of their embeddings on appropriate surfaces to reconstruct them. The principal aim of this work is to find new techniques of reconstruction …
-
Planar graphs : a historical perspective.
… has been indubitably influenced by the study of planar graphs. This thesis, consisting of five chapters, is a historical account of the origins and development of concepts pertaining to planar graphs and their applications. The first chapter serves as an introduction to the history of graph …
-
Edge-choosability of Planar Graphs
… ∆(G) ≤χ' (G)≤∆(G) + 1. We prove that if G is a planar graph without 7-cycles with ∆(G)≠5,6 , or without adjacent 4-cycles with ∆(G)≠5, or with no 3-cycles adjacent to 5-cycles, then G is edge-(∆ + 1)-choosable.
-
Straight-line realization of planar graphs.
Few theorems are known about planar graphs. For, example, Kuratowski proved that a graph is planar if and only if it has no subgraph homeomorphic to K₅ or K₃,₃. It has remained as a direct criterion for determining whether a graph is planar or not. Powerful as the theorem is, it is not always easy …
-
Acyclic List Colouring Locally Planar Graphs
… bicoloured cycle. In 1979, Borodin proved that planar graphs are acyclically 5-colourable. In 2010, Kawarabayashi and Mohar proved that locally planar graphs are acyclically 7-colourable. In 2002, Borodin, Fon-Der-Flaass, Kostochka, Raspaud, and Sopena proved that planar graphs are acyclically …
-
A Classification of Regular Planar Graphs
… the investigation and classification of regular planar graphs. The motive behind this investigation was a desire to better understand those properties which allow a graph to be represented in the plane in such a manner that no two edges cross except perhaps at vertices.
-
On the determination of planar graphs.
Various algorithms for testing the planarity of a graph are reviewed. The Phung-Chan algorithm is improved by modifying the method of application of the necessary and sufficient condition that a pseudo-Hamiltonian graph be planar and the method of determination of circuit C(k) with as many edges as …
-
Asymptotic study of regular planar graphs
… is the study of some families of regular planar graphs and maps. We are in particular interested in their asymptotic enumeration in order to understand of the associated uniform random model. In a first part, we give both an exact and an asymptotic enumeration of labelled cubic planar …
-
On Configurations Of Spatial Planar Graphs
… of a variety of families of configurations of graphs in R3 and S 3 . Preliminary results give that the linear configurations of the tetrahedral graph in R3 has the homotopy type of the double mapping cylinder SO(3)/A4 ← SO(3)/A3 [RIGHTWARDS ARROW] SO(3)/S3 , for An the alternating group and Sn …
-
Drawing planar graphs with prescribed face areas
This thesis deals with planar drawings of planar graphs such that each interior face has a prescribed area. Our work is divided into two main sections. The rst one deals with straight-line drawings and the second one with orthogonal drawings. For straight-line drawings, it was known that such …
-
Uniform random planar graphs with degree constraints
Random planar graphs have been the subject of much recent work. Many basic properties of the standard uniform random planar graph $P_{n}$, by which we mean a graph chosen uniformly at random from the set of all planar graphs with vertex set $ { 1,2, ldots, n }$, are now known, and variations on …
-
Separators in High-Genus Near-Planar Graphs
… motivated by divide and conquer algorithms on graphs. Results have shown the existence of separators in arbitrary planar graphs and other graphs with less restricted structure. This work explores planar separators and the planar separator theorem, as well as the existence of separators in the …
Page 1 of 12