DOCSLIB.ORG

Circular Drawing of Graphs

Total Page：16

File Type：pdf, Size：1020Kb

Download full-text PDF Read full-text
Circular Drawing of Graphs Chapter 11 Circular Drawing of Graphs 11.1 Introduction Graphs are used to represent many kinds of information structures: computer, telecom- munication, social networks, entity-relationship diagrams, data flow charts, resource alloca- tion maps, and much more. Graph Visualization is the study of techniques which produce drawings of graphs. These visualizations provide a snapshot of each graph and allow experts to be free from the work of organizing the nodes and edges and thereby allowing more time to interpret the composition of these structures. A circular graph drawing (see Figure 11.1 for an example) is a visualization of a graph with the following characteristics: ² The graph is partitioned into clusters, ² The nodes of each cluster are placed onto the circumference of an embedding circle, and ² Each edge is drawn as a straight line. There are many applications which would be strengthened by an accompanying circular graph drawing. For example, circular drawing techniques could be added to tools which h j g d f i c a i d g b a e i f e c b h Figure 11.1: A graph with arbitrary coordinates for the nodes and a circular drawing of the same graph as produced by an implementation of our algorithm. 1 manipulate telecommunication, computer, and social networks to show clustered views of those information structures. The partitioning of the graph into clusters can show structural information such as biconnectivity, or the clusters can highlight semantic qualities of the network such as sub-nets. Emphasizing natural group structures within the topology of the network is vital to pin-point strengths and weaknesses within that design. It is essential that the number of edge crossings within each cluster remain low in order to reduce the visual complexity of the resulting drawings. The remainder of this chapter is organized as follows: In section 2 we will discuss how to draw a graph on a single embedding circle with a low number of crossings. In section 3 and 4 algorithms for drawing graphs on multiple embedding circles will be discussed. In section 3 the circles will be determined by properties of the graph, while in section 4 we will consider user-de¯ned groups of graphs. 11.2 Circular Drawing on a single embedding circle In this chapter we will present algorithms that compute a permutation of vertices such that their placement on the periphery of a circle in this order will result in a low number of crossings. In general, the problem of minimizing the number of crossings is NP-complete. The algorithms we will describe guarantee that they produce a cross-free visualization if this is possible. In any other case, experimental results have shown a low number of crossings. We will divide the graphs into three categories each of which will be examined separately. The ¯rst class is trees, the second is biconnected graphs, and the third all other kinds of graphs. 11.2.1 Circular drawing of trees When the graph G(V; E) to visualize is a tree, there is always a way to place the vertices on the periphery of a circle in such a way that no two edges cross. The order of each vertex can simply be the discovery time of the vertex during a depth-¯rst search traversal of the tree. The procedure takes O(jV j+jEj) = (jV j) time since for every tree we have jEj = jV j¡1. Figure 11.2 illustrates an example. Figure 11.2: Circular drawing of a tree without crossings 11.2.2 Circular drawing of biconnected graphs In this section, we are interested in biconnected graphs. The reason for this is that if a biconnected graph admits a visualization with no crossings, there exists an algorithm for 2 ¯nding this embedding. Slight modi¯cation of this algorithm leads in a general algorithm which gives a small number of crossings in the general case. First we shall introduce the aspect of an outerplanar graph De¯nition 11.1 A graph is outerplanar i® it can be drawn on the plane such that all its vertices lie on the boundary of a single phase and no two edges cross. The requirement of placing all nodes on the periphery of some embedding circle is equivalent to placing all nodes on a single face (the external face) of some embedding. Thus, we would at least like to be able to recognize outerplanar graphs and draw them in a way that no crossings appear. The reason for concentrating on biconnected graphs, is that there is exactly one way to place the vertices of an outerplanar biconnected graph on the periphery of a circle without creating crossings. Theorem 11.1 There exists only one clockwise ordering of the nodes in a biconnected outerplanar graph G such that the drawing of G with the nodes in that order around the embedding circle is plane. P roof. It is obvious that any Hamilton circle, can be drawn on the periphery of an embedding circle in exactly one way. The ordering of the vertices has to be the same as in the hamilton circuit. In ¯gure 11.3 we can see an example of a non-planar drawing of a hamilton circle. Figure 11.3: A non-planar drawing of a simple cycle. So in order to prove the theorem it su±ces to show that every outerplanar biconnected graph is hamiltonian. We will prove this by contradiction. So let us say that an outerplanar biconnected graph is not hamiltonian. Let us consider the cross-free embedding E of the graph on a circle. Then there exists at least one pair of vertices that are placed succes- sively and are not neighbors,say u,v (¯gure 11.4). If we visit all vertices adjacent to u in a clockwise order starting from u, let w be the vertex we visit last. If we repeat the same procedure for vertex v but in counterclockwise order this time, the vertex we visit last has to be a vertex z appearing not later than w. If we meet z after w, it would mean that we would have at least one crossing, as the red line in ¯gure ilustrates.But the drawing is outerplanar so this is impossible. This means that either w=z, or z appears before w, in a counterclockwise traverse of the periphery starting from v. Furthermore no edge with an endpoint in arc u;d v can have its other endpoint inu; · v otherwise we would have crossings. This means that if z 6= w the graph is not connected, since no path connects u and v. On the other hand, if z = w the removal of this vertex would result in a disconnected graph for the same reason. This means the the graph is not biconnected. Both of these cases 3 contradict the fact that we have a biconnected outerplanar graph. So every outerplanar biconnected graph is hamiltonian. We know that it admits an out- erplanar drawing by de¯nition of an outerplanar graph, and this is unique because of the existence of a hamilton circuit. In addition, there is exactly one Hamilton circuit, other- wise, one of the Hamilton circuits would not be on the periphery, which according to the previous, would result in crossings. 2 Figure 11.4: Any biconnected outerplanar graph is hamiltonian. From the above we can see that in case of a biconnected outerplanar graph, the hamilton path has to appear on the periphery of the circle. The edges that are on the outer face are called External/Internal since one of the faces they belong to is the external face and the other internal. All other edges are Internal/Internal. This means that in order to ¯nd an outerplanar drawing it su±ces to ¯nd all the External/Internal edges, since they build the hamilton circuit. Equivalently, we can ¯nd all Internal/Internal edges. Biconnected outerplanar graphs have a series of properties that can help towards this direction. Theorem 11.2 [12] A graph G with n nodes is outerplanar if and only if either G is a triangle or 1. G has at most 2n ¡ 3 edges, 2. G has at least two degree two nodes, 3. No edge of G lies on more than two triangles, and 4. For any degree two node u which is adjacent to nodes v and w, the graph G minus node u plus the edge (v,w) (if not already in G) is also outerplanar. P roof We will only prove one direction of the theorem, that for every outerplanar graph the pre- vious criteria hold. 1. For every outerplanar graph G, jEj 5 2jV j ¡ 3 Consider a n-polygon. This is a hamilton circle of n vertices so it has n edges. If we select an arbitrary vertex u and draw edges towards all other vertices we will add n-3 more edges, edges towards all vertices except u and its two adjacent vertices in the hamilton circuit (¯gure 11.5). So we have an obviously outerplanar graph with 2jV j ¡ 3 edges. Now 4 it su±ces to show that no outerplanar graph can have more than 2jV j ¡ 3 edges. So let such a graph G(V; E), jEj > 2jV j ¡ 3 exist. If we add a vertex on the outer face and draw edges towards all other vertices we obtain a planar graph G'. This appears in ¯gure 11.6 Then for the new graph G0 we have: jV 0j = jV j + 1 jE0j = Ej + jV j > 3jV j ¡ 3 = 3jV 0j ¡ 6 But G' is planar, so Euler formula holds.
Load more

Recommended publications
  • K-Outerplanar Graphs, Planar Duality, and Low Stretch Spanning Trees
    k-Outerplanar Graphs, Planar Duality, and Low Stretch Spanning Trees Yuval Emek∗ Abstract Low distortion probabilistic embedding of graphs into approximating trees is an extensively studied topic. Of particular interest is the case where the approximating trees are required to be (subgraph) spanning trees of the given graph (or multigraph), in which case, the focus is usually on the equivalent problem of finding a (single) tree with low average stretch. Among the classes of graphs that received special attention in this context are k-outerplanar graphs (for a fixed k): Chekuri, Gupta, Newman, Rabinovich, and Sinclair show that every k-outerplanar graph can be probabilistically embedded into approximating trees with constant distortion regardless of the size of the graph. The approximating trees in the technique of Chekuri et al. are not necessarily spanning trees, though. In this paper it is shown that every k-outerplanar multigraph admits a spanning tree with constant average stretch. This immediately translates to a constant bound on the distortion of probabilistically embedding k-outerplanar graphs into their spanning trees. Moreover, an efficient randomized algorithm is presented for constructing such a low average stretch spanning tree. This algorithm relies on some new insights regarding the connection between low average stretch spanning trees and planar duality. Keywords: planar graphs, outerplanarity, average stretch, planar dual. ∗Microsoft Israel R&D Center, Herzelia, Israel and School of Electrical Engineering, Tel Aviv University, Tel Aviv, Israel. E-mail: [email protected]. Supported in part by the Israel Science Foundation, grants 221/07 and 664/05. 1 Introduction The problem.
    [Show full text]
  • Characterizations of Restricted Pairs of Planar Graphs Allowing Simultaneous Embedding with Fixed Edges
    Characterizations of Restricted Pairs of Planar Graphs Allowing Simultaneous Embedding with Fixed Edges J. Joseph Fowler1, Michael J¨unger2, Stephen Kobourov1, and Michael Schulz2 1 University of Arizona, USA {jfowler,kobourov}@cs.arizona.edu ⋆ 2 University of Cologne, Germany {mjuenger,schulz}@informatik.uni-koeln.de ⋆⋆ Abstract. A set of planar graphs share a simultaneous embedding if they can be drawn on the same vertex set V in the Euclidean plane without crossings between edges of the same graph. Fixed edges are common edges between graphs that share the same simple curve in the simultaneous drawing. Determining in polynomial time which pairs of graphs share a simultaneous embedding with fixed edges (SEFE) has been open. We give a necessary and sufficient condition for when a pair of graphs whose union is homeomorphic to K5 or K3,3 can have an SEFE. This allows us to determine which (outer)planar graphs always an SEFE with any other (outer)planar graphs. In both cases, we provide efficient al- gorithms to compute the simultaneous drawings. Finally, we provide an linear-time decision algorithm for deciding whether a pair of biconnected outerplanar graphs has an SEFE. 1 Introduction In many practical applications including the visualization of large graphs and very-large-scale integration (VLSI) of circuits on the same chip, edge crossings are undesirable. A single vertex set can be used with multiple edge sets that each correspond to different edge colors or circuit layers. While the pairwise union of all edge sets may be nonplanar, a planar drawing of each layer may be possible, as crossings between edges of distinct edge sets are permitted.
    [Show full text]
  • Minor-Closed Graph Classes with Bounded Layered Pathwidth
    Minor-Closed Graph Classes with Bounded Layered Pathwidth Vida Dujmovi´c z David Eppstein y Gwena¨elJoret x Pat Morin ∗ David R. Wood { 19th October 2018; revised 4th June 2020 Abstract We prove that a minor-closed class of graphs has bounded layered pathwidth if and only if some apex-forest is not in the class. This generalises a theorem of Robertson and Seymour, which says that a minor-closed class of graphs has bounded pathwidth if and only if some forest is not in the class. 1 Introduction Pathwidth and treewidth are graph parameters that respectively measure how similar a given graph is to a path or a tree. These parameters are of fundamental importance in structural graph theory, especially in Roberston and Seymour's graph minors series. They also have numerous applications in algorithmic graph theory. Indeed, many NP-complete problems are solvable in polynomial time on graphs of bounded treewidth [23]. Recently, Dujmovi´c,Morin, and Wood [19] introduced the notion of layered treewidth. Loosely speaking, a graph has bounded layered treewidth if it has a tree decomposition and a layering such that each bag of the tree decomposition contains a bounded number of vertices in each layer (defined formally below). This definition is interesting since several natural graph classes, such as planar graphs, that have unbounded treewidth have bounded layered treewidth. Bannister, Devanny, Dujmovi´c,Eppstein, and Wood [1] introduced layered pathwidth, which is analogous to layered treewidth where the tree decomposition is arXiv:1810.08314v2 [math.CO] 4 Jun 2020 required to be a path decomposition.
    [Show full text]
  • NP-Completeness of List Coloring and Precoloring Extension on the Edges of Planar Graphs
    NP-completeness of list coloring and precoloring extension on the edges of planar graphs D´aniel Marx∗ 17th October 2004 Abstract In the edge precoloring extension problem we are given a graph with some of the edges having a preassigned color and it has to be decided whether this coloring can be extended to a proper k-edge-coloring of the graph. In list edge coloring every edge has a list of admissible colors, and the question is whether there is a proper edge coloring where every edge receives a color from its list. We show that both problems are NP-complete on (a) planar 3-regular bipartite graphs, (b) bipartite outerplanar graphs, and (c) bipartite series-parallel graphs. This improves previous results of Easton and Parker [6], and Fiala [8]. 1 Introduction In graph vertex coloring we have to assign colors to the vertices such that neighboring vertices receive different colors. Starting with [7] and [28], a gener- alization of coloring was investigated: in the list coloring problem each vertex can receive a color only from its prescribed list of admissible colors. In the pre- coloring extension problem a subset W of the vertices have preassigned colors and we have to extend this precoloring to a proper coloring of the whole graph, using only colors from a given color set C. It can be viewed as a special case of list coloring: the list of a precolored vertex consists of a single color, while the list of every other vertex is C. A thorough survey on list coloring, precoloring extension, and list chromatic number can be found in [26, 1, 12, 13].
    [Show full text]
  • Star Coloring Outerplanar Bipartite Graphs
    Discussiones Mathematicae Graph Theory 39 (2019) 899–908 doi:10.7151/dmgt.2109 STAR COLORING OUTERPLANAR BIPARTITE GRAPHS Radhika Ramamurthi and Gina Sanders Department of Mathematics California State University San Marcos San Marcos, CA 92096-0001 USA e-mail: [email protected] Abstract A proper coloring of the vertices of a graph is called a star coloring if at least three colors are used on every 4-vertex path. We show that all outerplanar bipartite graphs can be star colored using only five colors and construct the smallest known example that requires five colors. Keywords: chromatic number, star coloring, outerplanar bipartite graph. 2010 Mathematics Subject Classification: 05C15. 1. Introduction A proper r-coloring of a graph G is an assignment of labels from {1, 2,...,r} to the vertices of G so that adjacent vertices receive distinct colors. The minimum r so that G has a proper r-coloring is called the chromatic number of G, denoted by χ(G). The chromatic number is one of the most studied parameters in graph theory, and by convention, the term coloring of a graph is usually used instead of proper coloring. In 1973, Gr¨unbaum [5] considered proper colorings with the additional constraint that the subgraph induced by every pair of color classes is acyclic, i.e., contains no cycles. He called such colorings acyclic colorings, and the minimum r such that G has an acyclic r-coloring is called the acyclic chromatic number of G, denoted by a(G). In introducing the notion of an acyclic coloring, Gr¨unbaum noted that the condition that the union of any two color classes induces a forest can be generalized to other bipartite graphs.
    [Show full text]
  • Lombardi Drawings of Graphs 1 Introduction
    Lombardi Drawings of Graphs Christian A. Duncan1, David Eppstein2, Michael T. Goodrich2, Stephen G. Kobourov3, and Martin Nollenburg¨ 2 1Department of Computer Science, Louisiana Tech. Univ., Ruston, Louisiana, USA 2Department of Computer Science, University of California, Irvine, California, USA 3Department of Computer Science, University of Arizona, Tucson, Arizona, USA Abstract. We introduce the notion of Lombardi graph drawings, named after the American abstract artist Mark Lombardi. In these drawings, edges are represented as circular arcs rather than as line segments or polylines, and the vertices have perfect angular resolution: the edges are equally spaced around each vertex. We describe algorithms for finding Lombardi drawings of regular graphs, graphs of bounded degeneracy, and certain families of planar graphs. 1 Introduction The American artist Mark Lombardi [24] was famous for his drawings of social net- works representing conspiracy theories. Lombardi used curved arcs to represent edges, leading to a strong aesthetic quality and high readability. Inspired by this work, we intro- duce the notion of a Lombardi drawing of a graph, in which edges are drawn as circular arcs with perfect angular resolution: consecutive edges are evenly spaced around each vertex. While not all vertices have perfect angular resolution in Lombardi’s work, the even spacing of edges around vertices is clearly one of his aesthetic criteria; see Fig. 1. Traditional graph drawing methods rarely guarantee perfect angular resolution, but poor edge distribution can nevertheless lead to unreadable drawings. Additionally, while some tools provide options to draw edges as curves, most rely on straight-line edges, and it is known that maintaining good angular resolution can result in exponential draw- ing area for straight-line drawings of planar graphs [17,25].
    [Show full text]
  • Surviving Rates of Trees and Outerplanar Graphs for the Firefighter Problem
    Surviving rates of trees and outerplanar graphs for the ¯re¯ghter problem Leizhen Cai¤ Yongxi Chengy Elad Verbinz Yuan Zhouz Abstract The ¯re¯ghter problem is a discrete-time game on graphs introduced by Hartnell in an attempt to model the spread of ¯re, diseases, computer viruses and suchlike in a macro-control level. To measure the defence ability of a graph as a whole, Cai and Wang de¯ned the surviving rate of a graph G for the ¯re¯ghter problem to be the average percentage of vertices that can be saved when a ¯re starts randomly at one vertex of G. In this paper, we prove that the surviving rate of every n-vertex outerplanar graph log n is at least 1 ¡ £( n ), which is asymptotically tight. We also show that the greedy log n strategy of Hartnell and Li for trees saves at least 1 ¡ £( n ) percentage of vertices on average for an n-vertex tree. Key words: ¯re¯ghter problem, surviving rate, tree, outerplanar graph 1 Introduction The study of a discrete-time game, the ¯re¯ghter problem, was initiated by Hartnell [7] in 1995 in an attempt to model the spread of ¯re, diseases, computer viruses and suchlike in a macro-control level. At time 0, a ¯re breaks out at a vertex v of a graph G = (V; E). At each subsequent time, a ¯re¯ghter protects one vertex not yet on ¯re, and the ¯re then spreads from all burning vertices to all their unprotected neighbors. The process ends when the ¯re can no longer spread.
    [Show full text]
  • Fractional and Circular Separation Dimension of Graphs
    Fractional and Circular Separation Dimension of Graphs Sarah J. Loeb∗and Douglas B. West† Revised June 2017 Abstract The separation dimension of a graph G, written π(G), is the minimum number of linear orderings of V (G) such that every two nonincident edges are “separated” in some ordering, meaning that both endpoints of one edge appear before both endpoints of the other. We introduce the fractional separation dimension πf (G), which is the minimum of a/b such that some a linear orderings (repetition allowed) separate every two nonincident edges at least b times. In contrast to separation dimension, fractional separation dimension is bounded: always πf (G) 3, with equality if and only if G contains K4. There is no stronger ≤ 3m bound even for bipartite graphs, since πf (Km,m) = πf (Km+1,m) = m+1 . We also compute πf (G) for cycles and some complete tripartite graphs. We show that πf (G) < √2 when G is a tree and present a sequence of trees on which the value tends to 4/3. Finally, we consider analogous problems for circular orderings, where pairs of non- incident edges are separated unless their endpoints alternate. Let π◦(G) be the number of circular orderings needed to separate all pairs and πf◦(G) be the fractional version. Among our results: (1) π◦(G) = 1 if and only G is outerplanar. (2) π◦(G) 2 when 3 ≤ G is bipartite. (3) π◦(Kn) log2 log3(n 1). (4) πf◦(G) 2 for every graph G, with ≥ − 3m 3 ≤ equality if and only if K4 G.
    [Show full text]
  • Peter Hoek Thesis
    Visual Encoding Approaches for Temporal Social Networks Peter John Hoek BIT (Distinction) CQU, MSc (IT) UNSW A thesis submitted in partial fulfilment of the requirements for the degree of Doctor of Information Technology at the School of Engineering and Information Technology The University of New South Wales at the Australian Defence Force Academy 2013 Abstract Visualisations have become an inseparable part of social network analysis methodologies. However, despite the large amount of work in the field of social network visualisation there are still a number of areas in which current visualisation methods can be improved. The current dynamic network visualisation approaches consisting of aggregation or animated movies suffer from various limitations, such as introducing artefacts that could obscure interesting micro-level patterns or disrupting the users’ internalised mental models. In addition, very few social network tools support the inclusion of semantic and contextual information or provide visual topological representations based on network node attributes. This thesis introduces novel approaches to the visualisation of social networks and assesses their effectiveness through the use of concept demonstrators and prototypes. These are the software artefacts of this thesis, which provide illustrations of complementary visualisation techniques that could be considered for inclusion into social network visualisation and analysis tools. The novel methods for visualising temporal networks introduced in this thesis consist of: i an Attribute-Based
    [Show full text]
  • Local Page Numbers
    Local Page Numbers Bachelor Thesis of Laura Merker At the Department of Informatics Institute of Theoretical Informatics Reviewers: Prof. Dr. Dorothea Wagner Prof. Dr. Peter Sanders Advisor: Dr. Torsten Ueckerdt Time Period: May 22, 2018 – September 21, 2018 KIT – University of the State of Baden-Wuerttemberg and National Laboratory of the Helmholtz Association www.kit.edu Statement of Authorship I hereby declare that this document has been composed by myself and describes my own work, unless otherwise acknowledged in the text. I declare that I have observed the Satzung des KIT zur Sicherung guter wissenschaftlicher Praxis, as amended. Ich versichere wahrheitsgemäß, die Arbeit selbstständig verfasst, alle benutzten Hilfsmittel vollständig und genau angegeben und alles kenntlich gemacht zu haben, was aus Arbeiten anderer unverändert oder mit Abänderungen entnommen wurde, sowie die Satzung des KIT zur Sicherung guter wissenschaftlicher Praxis in der jeweils gültigen Fassung beachtet zu haben. Karlsruhe, September 21, 2018 iii Abstract A k-local book embedding consists of a linear ordering of the vertices of a graph and a partition of its edges into sets of edges, called pages, such that any two edges on the same page do not cross and every vertex has incident edges on at most k pages. Here, two edges cross if their endpoints alternate in the linear ordering. The local page number pl(G) of a graph G is the minimum k such that there exists a k-local book embedding for G. Given a graph G and a vertex ordering, we prove that it is NP-complete to decide whether there exists a k-local book embedding for G with respect to the given vertex ordering for any fixed k ≥ 3.
    [Show full text]
  • Exploring the Earth-Moon Problem for Doubly Outerplanar Graphs
    Background Earth-Moon Problem Specific Cases of Earth-Moon Graphs Exploring The Earth-Moon Problem for Doubly Outerplanar Graphs Maia Wichman Grand Valley State University Partner: Hannah Critchfield, James Madison University Critchfield, Wichman Grand Valley State University REU Exploring The Earth-Moon Problem for Doubly Outerplanar Graphs Background Earth-Moon Problem Specific Cases of Earth-Moon Graphs Overview 1 Background 2 Earth-Moon Problem 3 Specific Cases of Earth-Moon Graphs Critchfield, Wichman Grand Valley State University REU Exploring The Earth-Moon Problem for Doubly Outerplanar Graphs A graph is planar if it can be drawn on the plane without edges crossing. Background Earth-Moon Problem Specific Cases of Earth-Moon Graphs A graph G is a set of vertices V together with a set of edges E which are pairs of vertices. Critchfield, Wichman Grand Valley State University REU Exploring The Earth-Moon Problem for Doubly Outerplanar Graphs A graph is planar if it can be drawn on the plane without edges crossing. Background Earth-Moon Problem Specific Cases of Earth-Moon Graphs A graph G is a set of vertices V together with a set of edges E which are pairs of vertices. Critchfield, Wichman Grand Valley State University REU Exploring The Earth-Moon Problem for Doubly Outerplanar Graphs Background Earth-Moon Problem Specific Cases of Earth-Moon Graphs A graph G is a set of vertices V together with a set of edges E which are pairs of vertices. A graph is planar if it can be drawn on the plane without edges crossing. Critchfield, Wichman Grand Valley State University REU Exploring The Earth-Moon Problem for Doubly Outerplanar Graphs Background Earth-Moon Problem Specific Cases of Earth-Moon Graphs A graph G is a set of vertices V together with a set of edges E which are pairs of vertices.
    [Show full text]
  • DISSERTATION GENERALIZED BOOK EMBEDDINGS Submitted By
    DISSERTATION GENERALIZED BOOK EMBEDDINGS Submitted by Shannon Brod Overbay Department of Mathematics In partial fulfillment of the requirements for the degree of Doctor of Philosophy Colorado State University Fort Collins, Colorado Summer 1998 COLORADO STATE UNIVERSITY May 13, 1998 WE HEREBY RECOMMEND THAT THE DISSERTATION PREPARED UNDER OUR SUPERVISION BY SHANNON BROD OVERBAY ENTITLED GENERALIZED BOOK EMBEDDINGS BE ACCEPTED AS FULFILLING IN PART REQUIREMENTS FOR THE DEGREE OF DOCTOR OF PHILOSO- PHY. Committee on Graduate Work Adviser Department Head ii ABSTRACT OF DISSERTATION GENERALIZED BOOK EMBEDDINGS An n-book is formed by joining n distinct half-planes, called pages, together at a line in 3-space, called the spine. The book thickness bt(G) of a graph G is the smallest number of pages needed to embed G in a book so that the vertices lie on the spine and each edge lies on a single page in such a way that no two edges cross each other or the spine. In the first chapter, we provide background material on book embeddings of graphs and preview our results on several related problems. In the second chapter, we use a theorem of Bernhart and Kainen and a result of Whitney to present a large class of two-page embeddable planar graphs. In particular, we prove that a graph G that can be drawn in the plane so that G has no triangles other than faces can be embedded in a two-page book. The discussion of planar graphs continues in the third chapter where we define a book with a tree-spine.
    [Show full text]