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 59 for “"Planar graphs"”.
-
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 …
-
Quartic planar graphs
… we explore three problems concerning quartic planar graphs. The First is on recursive structures
-
Quartic planar graphs
… we explore three problems concerning quartic planar graphs. The First is on recursive structures
-
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, …
-
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.
-
PLANAR GRAPHS, BIPLANAR GRAPHS AND GRAPH THICKNESS
<p>A graph is planar if it can be drawn on a piece of paper such that no two edges cross. The smallest complete and complete bipartite graphs that are not planar are K5 and K{3,3}. A biplanar graph is a graph whose edges can be colored using red and blue such that the red edges induce a planar …
-
Planar Graphs and their Duals on Cylinder Surfaces
… plane drawings of undirected and directed graphs on cylinder surfaces. In the case of undirected graphs, the vertices are positioned on a line that is parallel to the cylinder’s axis and the edge curves must not intersect this line. We show that a plane drawing is possible if and only if …
-
On Chen-Lih-Wu Conjecture for planar graphs
Submission original under an indefinite embargo labeled 'Open Access'. The submission was exported from vireo on 2024-03-01 without embargo terms
-
Algorithms for flows and disjoint paths in planar graphs
… flows, connectivity, and disjoint paths in planar graphs. In all cases, the algorithms are either the first polynomial-time algorithms or are faster than all previously-known algorithms. First, we describe algorithms for the maximum flow problem in directed planar graphs with integer …
-
Single-face non-crossing shortest paths in planar graphs
The student, Alexander Steiger, submitted this Thesis for approval on 2017-07-12 at 16:52.
-
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 …
-
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 …
-
A Sparsification Based Algorithm for Maximum-Cardinality Bipartite Matching in Planar Graphs
… have been studied on different classes of graphs, the one of special interest to us being the Maximum Cardinality Bipartite Matching in Planar Graphs. In this work, we present a novel sparsification based approach for computing maximum/perfect bipartite matching in planar graphs. The …
-
New Parallel Algorithms for Planarity Testing
Planar graphs (defined as graphs in which no edges cross) have special properties and are often used in applications such as circuit design or transportation networks. While many linear work implementations of planarity testing algorithms exist, to our best knowledge, there is no practical …
-
Problems in Sorting and Graph Algorithms
… for finding cycles of small fixed length in graphs. We give algorithms for general graphs and O(n log n) algorithms for cycles of length 5 or 6 in planar graphs. The fourth problem concerns the NP-completeness of a wire-routing problem. Specifically, the problem asks for vertex-disjoint paths …
-
Exploring the powers of stacks and queues via graph layouts
… we employ stack and queue layouts of graphs to explore the relative power of stacks and queues. Stack layout and queue layouts of graphs can be examined from several points of view. A stack or a queue layout of a graph can be thought of as an embedding of the graph in a plane …
-
Loop Edge Estimation in 4-Regular Hamiltonian Graphs
… that cannot be untangled to produce a simple planar loop. A mathematical knot is essentially a conventional knot tied with rope where the ends of the rope have been glued together. One way to sample large knots is based on choosing a 4-regular Hamiltonian planar graph. A method for generating …
-
Branch decompositions and their applications
… modeled as optimization or decision problems on graphs. Also, many of those real-life problems are NP-hard. One traditional method to solve these problems is by branch and bound while another method is by graph decompositions. In the 1980's, Robertson and Seymour conceived of two new ways to …
-
Product Structure, Separating Systems, Freeze-Tag Problem, and Planar Multicolor Turan Number
… focuses on the Product Structure Theorem for planar graphs, which asserts that any planar graph can be embedded in the strong product of a planar 3-tree, a path, and a 3-cycle. The paper presents a simple linear-time algorithm to find this decomposition for an n-vertex planar graph, improving …
-
Enumeration of polyhedral graphs
… vertex and face degree sequences for the graphs. Using a range of existence, ordered enumeration and isomorphism techniques, it finds all unique 4-regular, 3-connected planar graphs. The algorithm is a vertex addition algorithm which means that each result output at a given stage has a new …
Page 1 of 3