Figure 1 - uploaded by Sophia Potoczak

Content may be subject to copyright.

Source publication

A prominent question of topological graph theory is "what type of surface can a nonplanar graph be embedded into?" This thesis has two main goals. First to provide a necessary background in topology and graph theory to understand the development of an embedding algorithm. The main purpose is developing and proving a direct constructive embedding al...

## Similar publications

Recently, researchers at Qatar University in consultation with an industry partner constructed a space syntax model based on a 2013 Ministry of Municipality and Environment (MME) plan of Metropolitan Doha. The model encompasses nearly 23,000 streets stretching from Mesaieed in the south to Umm Al Abariq in the north and from the Arabian Gulf in the...

Ever since programming has become more and more popular, programmers have been guided by their natural instincts of solving complex problems. They pursue for new challenges that can test their problem solving and algorithmic skills. The practice of participating in programming contests to solve mathematical/algorithmic/logic challenges to enhance p...

A description of the 11 well-known uninodal planar nets is given by Cayley color graphs or alternative Cayley color graphs of plane groups. By applying methods from topological graph theory, the nets are derived from the bouquet B n with rotations mostly as voltages. It thus appears that translation, as a symmetry operation in these nets, is no mor...

In this paper, we present a constructive and proof-relevant development of graph theory, including the notion of maps, their faces, and maps of graphs embedded in the sphere, in homotopy type theory. This allows us to provide an elementary characterisation of planarity for locally directed finite and connected multigraphs that takes inspiration fro...

The paper discusses the role of normative and analytical theory in architectural design and practice. It argues that the architectural profession, in general, tends to be strong on implemented hypotheses (i.e. ideas) but weak on verifiable theory using a scientific approach, i.e. observation, data collection, and refinement/confirmation or refutati...

## Citations

... For example, let us take the rotation system on Q 3 that we dened previously and reverse the ordering of the edges around vertex 0. We change the rotation system ordering from (1,2,4) to (1,4,2) and the new rotation system is now Let us use the boundary walk algorithm to nd the boundary walks of this embedding. Since the entry around 0 has changed, when we start the walk with 0 − 1, and reach vertex 0 from 4, instead of going towards 1 and closing this boundary walk, we now go towards 2 and continue for a while before this boundary walk closes up. ...

... For example, let us take the rotation system on Q 3 that we dened previously and reverse the ordering of the edges around vertex 0. We change the rotation system ordering from (1,2,4) to (1,4,2) and the new rotation system is now Let us use the boundary walk algorithm to nd the boundary walks of this embedding. Since the entry around 0 has changed, when we start the walk with 0 − 1, and reach vertex 0 from 4, instead of going towards 1 and closing this boundary walk, we now go towards 2 and continue for a while before this boundary walk closes up. ...

... A convex icosahedron GRAPH EMBEDDING INTO SURFACESIn this chapter we introduce the main concepts and results related to graph embeddings and their representations ia rotation systems. The following are references for the material in sections 2.1-2.3 :[4] ...

The purpose of this thesis is to study hypercube graphs and their embeddings on orientable surfaces. We use rotation systems to represent these embeddings. We prove some results about the effect of adjacent switches in rotation system and create a rotation system called the ABC rotation system and prove general results about it. Using this rotation system, we give a general theorem about the minimal embedding of $Q_{n}$. We also look at some interesting types of maximal embedding of $Q_{n}$, such as the Eulerian walk embedding and the "big-face embedding". We prove a theorem that gives a recursively constructive way of obtaining the latter embedding in $Q_{n}