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 119 for “"Planar Graph"”.

  1. Facets of Planar Graph Drawing

    This thesis makes a contribution to the field of Graph Drawing, with a focus on the planarity drawing convention. The following three problems are considered. (1) Ordered Level Planarity: We introduce and study the problem Ordered Level Planarity which asks for a planar drawing of a graph such that …

    fu-berlin Repository record for Facets of Planar Graph Drawing (opens in a new tab)

  2. Embedding a Planar Graph on a Given Point Set

    A point-set embedding of a planar graph G with n vertices on a set S of n points is a planar straight-line drawing of G, where each vertex of G is mapped to a distinct point of S. We prove that the point-set embeddability problem is NP-complete for 3-connected planar graphs, answering a question of …

    manitoba Repository record for Embedding a Planar Graph on a Given Point Set (opens in a new tab)

  3. Planar Graph Generation with Application to Water Distribution Networks

    … system we need realistic networks which are also planar. Currently available synthetic network generators can generate networks that exhibit realism but the planarity is not guaranteed. On the other hand, existing water network generators do not guarantee similarity with the input network and do …

    clemson Repository record for Planar Graph Generation with Application to Water Distribution Networks (opens in a new tab)

  4. The Chromatic Category: A Connection Between Planar Graph Colouring and Representation Theory

    … about the proper colourings of the duals of planar graphs. In this work, we show that the chromatic category is pivotal, provide a basis for its morphisms spaces, and show that it is related to several other categories in the literature. In particular, under some assumptions, we show that …

    ottawa-retro Repository record for The Chromatic Category: A Connection Between Planar Graph Colouring and Representation Theory (opens in a new tab)

  5. Simplified O(n) algorithms for planar graph embedding, Kuratowski subgraph isolation, and related problems

    A graph is planar if it can be drawn on the plane with vertices at unique locations and no edge intersections. Due to the wealth of interest from the computer science community, there are a number of remarkable but complex O(n) planar embedding algorithms. This dissertation presents a new method …

    uvic Repository record for Simplified O(n) algorithms for planar graph embedding, Kuratowski subgraph isolation, and related problems (opens in a new tab)

  6. Small cycle cover, group coloring with related problems

    … conjectured that if G is a simple 2-connected graph with n ≥ 3 vertices, then the edges of G can be covered by at most 2n-33 cycles. In Chapter 2, a result on small cycle cover is obtained and we also show that the result is as best as possible.;Thomassen conjectured that every 4-connected line …

    wvu Repository record for Small cycle cover, group coloring with related problems (opens in a new tab)

  7. Acyclic 5-Choosability of Planar Graphs Without Adjacent Short Cycles

    The conjecture claiming that every planar graph is acyclic 5-choosable[Borodin et al., 2002] has been verified for several restricted classes of planargraphs. Recently, O. V. Borodin and A. O. Ivanova, [Journal of Graph Theory,68(2), October 2011, 169-176], have shown that a planar graph is …

    brock Repository record for Acyclic 5-Choosability of Planar Graphs Without Adjacent Short Cycles (opens in a new tab)

  8. Backbone Colouring of Graphs

    Consider an undirected graph G and a subgraph of G, H. A q-backbone k-colouring of (G,H) is a mapping f: V(G) {1, 2, ..., k} such that G is properly coloured and for each edge of H, the colours of its endpoints differ by at least q. The minimum number k for which there is a backbone k-colouring of …

    brock Repository record for Backbone Colouring of Graphs (opens in a new tab)

  9. Density and Structure of Homomorphism-Critical Graphs

    Let $H$ be a graph. A graph $G$ is $H$-critical if every proper subgraph of $G$ admits a homomorphism to $H$, but $G$ itself does not. In 1981, Jaeger made the following conjecture concerning odd-cycle critical graphs: every planar graph of girth at least $4t$ admits a homomorphism to $C_{2t+1}$ …

    waterloo Repository record for Density and Structure of Homomorphism-Critical Graphs (opens in a new tab)

  10. Coloring the Square of Planar Graphs Without 4-Cycles or 5-Cycles

    The famous Four Color Theorem states that any planar graph can be properly colored using at most four colors. However, if we want to properly color the square of a planar graph (or alternatively, color the graph using distinct colors on vertices at distance up to two from each other), we will …

    vcu Repository record for Coloring the Square of Planar Graphs Without 4-Cycles or 5-Cycles (opens in a new tab)

  11. An Alternative Approach to Counting Minimum (s; t)-cuts in Planar Graphs

    Finding and counting minimum cuts in graphs can be useful in image processing and segmentation and in networking systems such as computer or road networks. Researchers have previously developed polynomial-time algorithms to count minimum cuts in planar graphs which utilize the relationship between …

    rit Repository record for An Alternative Approach to Counting Minimum (s; t)-cuts in Planar Graphs (opens in a new tab)

  12. An Asymptotically Optimal Implementation of Product Structure Theorem for Planar Graphs

    … of several longstanding open problems on planar graphs. These theorems allow for the factorization of a planar graph into simpler, more manageable components. Until 2022, the best algorithm for implementing such a factorization had a running time of O(n log n), limiting its use in …

    carleton Repository record for An Asymptotically Optimal Implementation of Product Structure Theorem for Planar Graphs (opens in a new tab)

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

    ubc Repository record for Straight-line realization of planar graphs. (opens in a new tab) Download PDF for Straight-line realization of planar graphs. (opens in a new tab)

  14. Planar Zero-Divisor Graphs

    … nonzero commutative ring with identity is a graph whose vertices are the nonzero zero-divisors, and such that two distinct vertices x and y are adjacent if and only if xy = 0. this graph is called the zero-divisor graph of the ring. Now assume that the ring is not a field. A result of Akbari, …

    mo-state Repository record for Planar Zero-Divisor Graphs (opens in a new tab)

  15. List Coloring Some Classes of 1-Planar Graphs

    In list coloring we are given a graph G and a list assignment for G which assigns to each vertex of G a list of possible colors. We wish to find a coloring of the vertices of G such that each vertex uses a color from its list and adjacent vertices are given different colors. In this thesis we study …

    waterloo Repository record for List Coloring Some Classes of 1-Planar Graphs (opens in a new tab)

  16. Extremal Problems for Partitions of Edge Sets of Graphs

    … thesis considers three families of problems in graph theory about partitions of the edge sets of graphs (also known as graph decompositions). The first family we address consists of induced Ramsey number problems. Induced Ramsey numbers generalize ordinary Ramsey numbers. The induced Ramsey …

    uiuc Repository record for Extremal Problems for Partitions of Edge Sets of Graphs (opens in a new tab)

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

    oxford Repository record for Uniform random planar graphs with degree constraints (opens in a new tab)

  18. A Parameterized Algorithm for Upward Planarity Testing of Biconnected Graphs

    We can visualize a graph by producing a geometric representation of the graph in which each node is represented by a single point on the plane, and each edge is represented by a curve that connects its two endpoints. Directed graphs are often used to model hierarchical structures; in order to …

    waterloo Repository record for A Parameterized Algorithm for Upward Planarity Testing of Biconnected Graphs (opens in a new tab)

  19. Clifford Simulation: Techniques and Applications

    … formalism, CH form, affine form, and the graph state formalism. We describe each simulation method and give four different proofs of the Gottesman-Knill theorem. Next we review a recent work [15], which shows that restricting the geometry of Clifford circuits can lead to a further speedup. …

    waterloo Repository record for Clifford Simulation: Techniques and Applications (opens in a new tab)

  20. Structural Graph-based Metamodel Matching

    … shortcomings. Thereby, we take advantage of the graph structure of metamodels. Consequently, we derive a planar graph edit distance as metamodel similarity metric and mining-based matching to make use of redundant information. We also propose a planar graph-based partitioning to cope with …

    qucosa-diss

Page 1 of 6