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 24 for “"Topological Graph Theory"”.

  1. Structural and Topological Graph Theory and Well-Quasi-Ordering

    Στη σειρά εργασιών Ελασσόνων Γραφημάτων, οι Neil Robertson και Paul Seymour μεταξύ άλλων σπουδαίων αποτελεσμάτων, απέδειξαν την εικασία του Wagner που σήμερα είναι γνωστή ως το Θεώρημα των Robertson και Seymour. Σε κάθε τους βήμα προς την συναγωγή της τελικής απόδειξης της εικασίας, κάθε ειδική …

    athens Repository record for Structural and Topological Graph Theory and Well-Quasi-Ordering (opens in a new tab)

  2. Combinatorial maps and the foundations of topological graph theory : a thesis presented in partial fulfilment of the requirements for the degree of Doctor of Philosophy in Mathematics at Massey University

    This work.develops the foundations of topological graph theory with a unified approach using combinatorial maps. (A combinatorial map is an n-regular graph endowed with proper edge colouring in n colours.) We establish some new results and some generalisations of important theorems in topological …

    massey Repository record for Combinatorial maps and the foundations of topological graph theory : a thesis presented in partial fulfilment of the requirements for the degree of Doctor of Philosophy in Mathematics at Massey University (opens in a new tab)

  3. 3-Maps And Their Generalizations

    … in their paper 3-maps. This thesis introduces topological graph theory and then investigates 3-maps in detail, including examples, special types of 3-maps, the use of 3-maps to find the genus of special graphs, and a generalization known as n-maps.

    vcu Repository record for 3-Maps And Their Generalizations (opens in a new tab)

  4. Some aspects of graph theory

    … others on my work over the years. My interest in graph theory was originally stimulated in 1968 by Alfred Lehman, who supervised my masterate at the University of Toronto. The resulting thesis consisted of the development and implementation of an algorithm for testing the planarity of a graph. …

    massey Repository record for Some aspects of graph theory (opens in a new tab)

  5. Average Cayley Genus for Groups with Two Generators of Order Greater Than Two

    … the orientable surfaces on which a particular graph may be imbedded is a basic problem in the area of topological graph theory. We look at groups modeled by Cayley graphs. Imbedding Cayley graphs with symmetry is done using Cayley maps. It is of interest to find the average Cayley genus for a …

    unlv Repository record for Average Cayley Genus for Groups with Two Generators of Order Greater Than Two (opens in a new tab) Download PDF for Average Cayley Genus for Groups with Two Generators of Order Greater Than Two (opens in a new tab)

  6. Graph Coverings with Few Eigenvalues or No Short Cycles

    This thesis addresses the extent of the covering graph construction. How much must a cover X resemble the graph Y that it covers? How much can X deviate from Y? The main statistics of X and Y which we will measure are their regularity, the spectra of their adjacency matrices, and the length of …

    waterloo Repository record for Graph Coverings with Few Eigenvalues or No Short Cycles (opens in a new tab)

  7. Minors and planar embeddings of digraphs

    Embedding graphs in surfaces is the central concept of topological graph theory. Classifying embeddability of graphs is motivated by Kuratowski’s Theorem and Robertson-Seymour theory, which confirms that the set of obstructions to embeddability in an arbitrary surface is finite. We consider …

    auckland-ms Repository record for Minors and planar embeddings of digraphs (opens in a new tab)

  8. MacLane's Theorem for Graph-Like Spaces

    The cycle space of a finite graph is the subspace of the edge space generated by the edge sets of cycles, and is a well-studied object in graph theory. Recently progress has been made towards extending the theory of cycle spaces to infinite graphs. Graph-like spaces are a class of topological …

    waterloo Repository record for MacLane's Theorem for Graph-Like Spaces (opens in a new tab)

  9. Topological Operations for Genus Distributions and Embeddings of Graphs

    The research of graph embeddings on surfaces started from Euler's equation v e+f = 2. For a connected graph G, v, e and f represent the number of vertices, edges and regions of an embedding on a plane or sphere. Genus embedding of graphs is one of the most studied subjects in topological graph …

    auckland-ms Repository record for Topological Operations for Genus Distributions and Embeddings of Graphs (opens in a new tab)

  10. Vertex-transitive graphs and maps and their automorphism groups

    … combinatorial structures - vertex transitive graphs. One of the best known examples of infinite families of vertex-transitive graphs are the Cayley graphs. Besides these, and some additional sporadic examples, not many examples have been known. Quite recently, a great deal of activity has …

    nebraska Repository record for Vertex-transitive graphs and maps and their automorphism groups (opens in a new tab)

  11. Study on Two Optimization Problems: Line Cover and Maximum Genus Embedding

    … Geometry and Maximum Genus Embedding (MGE) in Topological Graph Theory. We study LCP whose decision version is known NP-Complete from the perspective of Parameterized Complexity, as well as classical techniques in Algorithm Design. In particular, we provide an exact algorithm in time O(n^3 2n) …

    tamu Repository record for Study on Two Optimization Problems: Line Cover and Maximum Genus Embedding (opens in a new tab)

  12. Some isoperimetric-type problems on graphs

    … isoperimetric problems are extremal problems on graphs that ask how we can choose a fixed number of vertices that are as closely packed as possible to have a small 'boundary'. This thesis discusses three problems with this common motivation behind, while varying how we measure the boundary and …

    bristol Repository record for Some isoperimetric-type problems on graphs (opens in a new tab) Download PDF for Some isoperimetric-type problems on graphs (opens in a new tab)

  13. Properties and algorithms of the (n, k)-arrangement graphs

    … introduced in 1992. The (n, k )-arrangement graph is a class of generalized star graphs. Compared with the well known n-star, the (n, k )-arrangement graph is more flexible in degree and diameter. However, there are few algorithms designed for the (n, k)-arrangement graph up to present. In …

    brock Repository record for Properties and algorithms of the (n, k)-arrangement graphs (opens in a new tab)

  14. Two Results in Drawing Graphs on Surfaces

    … work we present results on crossing-critical graphs drawn on non-planar surfaces and results on edge-hamiltonicity of graphs on the Klein bottle. We first give an infinite family of graphs that are 2-crossing-critical on the projective plane. Using this result, we construct 2-crossing-critical …

    lsu-thes Repository record for Two Results in Drawing Graphs on Surfaces (opens in a new tab)

  15. Thomassen’s 5-Choosability Theorem Extends to Many Faces

    We prove in this thesis that planar graphs can be L-colored, where L is a list-assignment in which every vertex has a 5-list except for a collection of arbitrarily large faces which have 3-lists, as long as those faces are at least a constant distance apart. Such a result is analogous to …

    waterloo Repository record for Thomassen’s 5-Choosability Theorem Extends to Many Faces (opens in a new tab)

  16. 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 …

    cornell Repository record for On Configurations Of Spatial Planar Graphs (opens in a new tab)

  17. Analyzing Tree Attachments in 2-Crossing-Critical Graphs with a V8 Minor

    The crossing number of a graph is the minimum number of pairwise edge crossings in a drawing of the graph in the plane. A graph G is k-crossing-critical if its crossing number is at least k and if every proper subgraph H of G has crossing number less than k. It follows directly from Kuratowski's …

    waterloo Repository record for Analyzing Tree Attachments in 2-Crossing-Critical Graphs with a V8 Minor (opens in a new tab)

  18. Fast algorithms for surface embedded graphs via homology

    Made available in DSpace on 2014-01-16T17:54:48Z (GMT). No. of bitstreams: 3 Kyle_Fox.pdf: 3026914 bytes, checksum: c71a059d2688d88bc4678429df958563 (MD5) dissertation.zip: 35243792 bytes, checksum: 5c50fb8cf2afd614d071c635e5821a34 (MD5) license.txt: 4058 bytes, checksum: …

    uiuc Repository record for Fast algorithms for surface embedded graphs via homology (opens in a new tab)

  19. Finding obstructions within irreducible triangulations

    … minimal obstructions of a surface S as subgraphs of the irreducible triangulations of the surface S with a crosscap added. A new data structure, i.e. an augmented rotation system, is presented and used to create an exponential-time algorithm for embedding graphs in any surface with a …

    uvic Repository record for Finding obstructions within irreducible triangulations (opens in a new tab)

  20. Embeddings of Product Graphs Where One Factor is a Hypercube

    Voltage graph theory can be used to describe embeddings of product graphs if one factor is a Cayley graph. We use voltage graphs to explore embeddings of various products where one factor is a hypercube, describing some minimal and symmetrical embeddings. We then define a graph product, the weak …

    vcu Repository record for Embeddings of Product Graphs Where One Factor is a Hypercube (opens in a new tab)

Page 1 of 2