DOCSLIB.ORG

On the Pathwidth of Planar Graphs Omid Amini, Florian Huc, Stéphane Pérennes

Total Page：16

File Type：pdf, Size：1020Kb

Download full-text PDF Read full-text

Load more

On the Pathwidth of Planar Graphs Omid Amini, Florian Huc, Stéphane Pérennes To cite this version: Omid Amini, Florian Huc, Stéphane Pérennes. On the Pathwidth of Planar Graphs. [Research Report] 2006, pp.6. inria-00082035 HAL Id: inria-00082035 https://hal.inria.fr/inria-00082035 Submitted on 7 Jul 2006 HAL is a multi-disciplinary open access L’archive ouverte pluridisciplinaire HAL, est archive for the deposit and dissemination of sci- destinée au dépôt et à la diffusion de documents entific research documents, whether they are pub- scientifiques de niveau recherche, publiés ou non, lished or not. The documents may come from émanant des établissements d’enseignement et de teaching and research institutions in France or recherche français ou étrangers, des laboratoires abroad, or from public or private research centers. publics ou privés. INSTITUT NATIONAL DE RECHERCHE EN INFORMATIQUE ET EN AUTOMATIQUE On the Pathwidth of Planar Graphs Omid Amini — Florian Huc — Stéphane Pérennes N° ???? Juin 2006 Thème COM INRIA/RR--????--FR+ENG ISRN 0249-6399 ISSN On the Pathwidth of Planar Graphs Omid Amini ∗ y , Florian Huc ∗ z, Stéphane Pérennes ∗ Thème COM — Systèmes communicants Projets MASCOTTE Rapport de recherche n° ???? — Juin 2006 — 6 pages Abstract: Fomin and Thilikos in [5] conjectured that there is a constant c such that, for every 2- connected planar graph G, pw(G∗) ≤ 2pw(G)+c (the same question was asked simutaneously by Coudert, Huc and Sereni in [4]). By the results of Boedlander and Fomin [2] this holds for every outerplanar graph and actually is tight by Coudert, Huc and Sereni [4]. In [5], Fomin and Thilikos proved that there is a constant c such that the pathwidth of every 3-connected graph G satisfies: pw(G∗) ≤ 6pw(G) + c. In this paper we improve this result by showing that the dual a 3-connected planar graph has pathwidth at most 3 times the pathwidth of the primal plus two. We prove also that the question can be answered positively for 4-connected planar graphs. Key-words: planar graphs, pathwidth ∗ Projet Mascotte (cnrs, inria, unsa), INRIA Sophia-Antipolis, 2004 route des Lucioles BP 93, 06902 Sophia-Antipolis Cedex, France y École Polytechnique, 91120 Palaiseau z This author is partialy supported by Région Provence Alpes Côte d'Azur Unité de recherche INRIA Sophia Antipolis 2004, route des Lucioles, BP 93, 06902 Sophia Antipolis Cedex (France) Téléphone : +33 4 92 38 77 77 — Télécopie : +33 4 92 38 77 65 A Propos de la Pathwidth des Graphes Planaires Résumé : Fomin et Thilikos[5], après avoir démontré que la pathwidth de tout graphes planaires 3-connexe est au plus 6 fois celle de son dual à une constante près, ont conjecturé que pour tout graphe planaire biconnexe G, pw(G∗) ≤ 2pw(G) + cte. D'après Boedlander et Fomin [2] cela est vrai pour tout graphe outerplanaire. De plus cela est exact d'après Coudert, Huc and Sereni [4]. Dans cet article nous améliorons le résultat de Fomin et Thilikos en montrant que la pathwidth de tout graphe planaire 3-connexe est au plus 3 fois celle de son dual plus 2. Nous démontrons également que la conjecture est vrai pour tout graphe planaire dont le dual est 4-connexe. Mots-clés : graphes planaires, pathwidth On the Pathwidth of Planar Graphs 3 1 Introduction A planar graph is a graph that can be embedded in the plane without crossing edges. It is said to be outerplanar if it can be embedded in the plane without crossing edges and such that all its vertices are incident to the unbounded face. For any graph G, we denote by V (G) its vertex set and by E(G) its edge set. The dual of the planar graph G, denoted by G∗, is the graph obtained by putting one vertex for each face, and joining two vertices if and only if the corresponding faces are adjacent. Note that the dual of a planar graph can also be computed in linear time. The notion of pathwidth was introduced by Robertson and Seymour [9]. A path decomposition of a graph G = (V; E) is a set system (X1; : : : ; Xr) of V such that r 1. Si=1 Xi = V ; 2. 8xy 2 E; 9i 2 f1; : : : ; rg : fx; yg ⊂ Xi; 3. for all 1 ≤ i0 < i1 < i2 ≤ r, Xi0 \ Xi2 ⊆ Xi1 . The width of the path decomposition (X1; : : : ; Xr) is max1≤i≤r jXij − 1. The pathwidth of G, denoted by pw(G), is the minimum width over its path decompositions. Computing the pathwidth of graphs is an active research area, in which a lot of work has been done (Fer a survay see for instance [8]). Govindan et al. [6] gave an O(n log(n)) time algorithm for approximating the pathwidth of outerplanar graphs with a multiplicative factor of 3. For biconnected outerplanar graphs, Bodlaender and Fomin [2] improved upon this result by giving a linear time algorithm which approximates the pathwidth of biconnected outerplanar graphs with a multiplicative factor 2. To do so, they exhibit a relationship between the pathwidth of an outerplanar graph and the pathwidth of its dual. More precisely, the following holds. Theorem 1 (Bodlaender and Fomin [2]) Let G be a biconnected outerplanar graph without loops and multiple edges. Then pw(G∗) ≤ pw(G) ≤ 2pw(G∗) + 2. Since the weak dual of an outerplanar graph (which can be computed in linear time) is a tree and there exist linear time algorithms to compute the pathwidth of a tree [11], this yields the desired approximation. Coudert, Huc and Sereni in [4] improved this result by proving the following theorem: Theorem 2 (Coudert, Huc and Sereni [4]) For every biconnected outerplanar graph G, we have pw(G∗) ≤ pw(G) ≤ 2 pw(G∗) − 1 and all the values in the interval [pw(G∗) ; 2 pw(G∗) − 1] can be the pathwidth of G. Simultaneously Coudert, Huc and Sereni state the following question as an open problem in [4] and Fomin and Thilikos conjectured it in [5] : 1 ∗ Conjecture 1 ([5],[4]) Is there a constant c such that, for every 2-connected planar graph G, 2 pw(G )− c ≤ pw(G) ≤ 2pw(G∗) + c? It is worth noting that this conjecture is motivated by the following result about the treewidth, conjectured by Robertson and Seymour [10] and proved by Lapoire [7] using algebraic methods (notice that Bouchitté, Mazoit and Todinca [3] gave a shorter and combinatorial proof of this result). Theorem 3 ([7]) For every planar graph G, tw(G) ≤ tw(G∗) + 1. Fomin and Thilikos made an even stronger conjecture : Conjecture 2 ([5]) There is a constant c such that for every 2-connected planar graphs G of treewidth ∗ m at least m, pw(G ) ≤ m−1 pw(G) + c RR n° 0123456789 4 Omid Amini , Florian Huc , Stéphane Pérennes This conjecture does not hold. Indeed we can slightly modify the examples given in [4]. They are example of biconected outerplanar graphs G such that pw(G) = 2pw(G∗) − 1. We modify this family of graph by plugging a 3 × 3 grid on a face. This can be done without changing the pathwidth, whereas the treewidth increases from 2 to 3, so the equation is no longer satisfied. The following theorem improves the previously known bound for 3-connected planar graphs. Theorem 4 (Main theorem) For every 3-connected planar graph G we have pw(G) ≤ 3 pw(G∗) + 2 Actually our methods prove that the conjecture holds for every 4-connected planar graph. 2 Main Theorem In this section we present the proof of our main theorem. We will use the following notations: Given a graph G = (V (G); E(G)) of maximum degree ∆(G), we will note V (G∗) either its face set or the vertex set of its dual and by fG, eG and nG respectively the number of faces, edges and vertices of G. Given a set A, by P(A) we denote the family of all subsets of A. Definition 1 Let G and H be two graphs. A connected map from G to H is a map σ : V (G) ! P(V (H)) from vertices of G to subsets of vertices of H satisfying the following two properties: 1. for every v 2 V (G) , σ(v) is connected. 2. for every adjacent vertices v; w 2 V (G), σ(v) [ σ(w) is also connected σ is of degree at most k if it also satisfies • 8w 2 V (H) we have jσ−1(w) := fv 2 V (G)jw 2 σ(v)gj ≤ k Lemma 1 Let G and H be two graphs. for any connected map σ of degree at most k from G to H, we have: • pw(G) ≤ k pw(H) + k − 1 • tw(G) ≤ k tw(H) + k − 1 Proof • Given a path-decomposition of H of width `, applying σ−1 on bags of our decomposition gives one of width k:` + k − 1 for G. This can be easily verified using the properties of σ listed above. • Same proof gives the result for tree-width. From now on we suppose G to be a 3 vertex connected planar graph. We aim to find a low degree connected map from G∗ to G. A Face-To-Edge assignment is a system of distinct representatives for faces of G. In other words, a Face-To-Edge assignment is a function τ such that we associate to a given face F of G an edge τ(F ) = (v; w) 2 E(F ) ⊂ E(G), in such a way that two different faces are associated to different edges. Given a Face-To-Edge assignment, the map σ : G∗ ! P(V (G)) associates to every vertex F of G∗ (face of G) the subset V (F ) n V (τ(F )).
Recommended publications
  • On Treewidth and Graph Minors

    On Treewidth and Graph Minors

    On Treewidth and Graph Minors Daniel John Harvey Submitted in total fulfilment of the requirements of the degree of Doctor of Philosophy February 2014 Department of Mathematics and Statistics The University of Melbourne Produced on archival quality paper ii Abstract Both treewidth and the Hadwiger number are key graph parameters in structural and al- gorithmic graph theory, especially in the theory of graph minors. For example, treewidth demarcates the two major cases of the Robertson and Seymour proof of Wagner's Con- jecture. Also, the Hadwiger number is the key measure of the structural complexity of a graph. In this thesis, we shall investigate these parameters on some interesting classes of graphs. The treewidth of a graph defines, in some sense, how \tree-like" the graph is. Treewidth is a key parameter in the algorithmic field of fixed-parameter tractability. In particular, on classes of bounded treewidth, certain NP-Hard problems can be solved in polynomial time. In structural graph theory, treewidth is of key interest due to its part in the stronger form of Robertson and Seymour's Graph Minor Structure Theorem. A key fact is that the treewidth of a graph is tied to the size of its largest grid minor. In fact, treewidth is tied to a large number of other graph structural parameters, which this thesis thoroughly investigates. In doing so, some of the tying functions between these results are improved. This thesis also determines exactly the treewidth of the line graph of a complete graph. This is a critical example in a recent paper of Marx, and improves on a recent result by Grohe and Marx.
  • Counting Independent Sets in Graphs with Bounded Bipartite Pathwidth∗

    Counting Independent Sets in Graphs with Bounded Bipartite Pathwidth∗

    Counting independent sets in graphs with bounded bipartite pathwidth∗ Martin Dyery Catherine Greenhillz School of Computing School of Mathematics and Statistics University of Leeds UNSW Sydney, NSW 2052 Leeds LS2 9JT, UK Australia [email protected] [email protected] Haiko M¨uller∗ School of Computing University of Leeds Leeds LS2 9JT, UK [email protected] 7 August 2019 Abstract We show that a simple Markov chain, the Glauber dynamics, can efficiently sample independent sets almost uniformly at random in polynomial time for graphs in a certain class. The class is determined by boundedness of a new graph parameter called bipartite pathwidth. This result, which we prove for the more general hardcore distribution with fugacity λ, can be viewed as a strong generalisation of Jerrum and Sinclair's work on approximately counting matchings, that is, independent sets in line graphs. The class of graphs with bounded bipartite pathwidth includes claw-free graphs, which generalise line graphs. We consider two further generalisations of claw-free graphs and prove that these classes have bounded bipartite pathwidth. We also show how to extend all our results to polynomially-bounded vertex weights. 1 Introduction There is a well-known bijection between matchings of a graph G and independent sets in the line graph of G. We will show that we can approximate the number of independent sets ∗A preliminary version of this paper appeared as [19]. yResearch supported by EPSRC grant EP/S016562/1 \Sampling in hereditary classes". zResearch supported by Australian Research Council grant DP190100977. 1 in graphs for which all bipartite induced subgraphs are well structured, in a sense that we will define precisely.
  • Regular Non-Hamiltonian Polyhedral Graphs

    Regular Non-Hamiltonian Polyhedral Graphs

    Regular Non-Hamiltonian Polyhedral Graphs Nico VAN CLEEMPUT∗y and Carol T. ZAMFIRESCU∗zx July 2, 2018 Abstract. Invoking Steinitz' Theorem, in the following a polyhedron shall be a 3-connected planar graph. From around 1880 till 1946 Tait's conjecture that cu- bic polyhedra are hamiltonian was thought to hold|its truth would have implied the Four Colour Theorem. However, Tutte gave a counterexample. We briefly survey the ensuing hunt for the smallest non-hamiltonian cubic polyhedron, the Lederberg-Bos´ak-Barnettegraph, and prove that there exists a non-hamiltonian essentially 4-connected cubic polyhedron of order n if and only if n ≥ 42. This ex- tends work of Aldred, Bau, Holton, and McKay. We then present our main results which revolve around the quartic case: combining a novel theoretical approach for determining non-hamiltonicity in (not necessarily planar) graphs of connectivity 3 with computational methods, we dramatically improve two bounds due to Zaks. In particular, we show that the smallest non-hamiltonian quartic polyhedron has at least 35 and at most 39 vertices, thereby almost reaching a quartic analogue of a famous result of Holton and McKay. As an application of our results, we obtain that the shortness coefficient of the family of all quartic polyhedra does not exceed 5=6. The paper ends with a discussion of the quintic case in which we tighten a result of Owens. Keywords. Non-hamiltonian; non-traceable; polyhedron; planar; 3-connected; regular graph MSC 2010. 05C45, 05C10, 05C38 1 Introduction Due to Steinitz' classic theorem that the 1-skeleta of 3-polytopes are exactly the 3-connected planar graphs [34], we shall call such a graph a polyhedron.
  • Randomly Coloring Graphs of Logarithmically Bounded Pathwidth Shai Vardi

    Randomly Coloring Graphs of Logarithmically Bounded Pathwidth Shai Vardi

    Randomly coloring graphs of logarithmically bounded pathwidth Shai Vardi To cite this version: Shai Vardi. Randomly coloring graphs of logarithmically bounded pathwidth. 2018. hal-01832102 HAL Id: hal-01832102 https://hal.archives-ouvertes.fr/hal-01832102 Preprint submitted on 6 Jul 2018 HAL is a multi-disciplinary open access L’archive ouverte pluridisciplinaire HAL, est archive for the deposit and dissemination of sci- destinée au dépôt et à la diffusion de documents entific research documents, whether they are pub- scientifiques de niveau recherche, publiés ou non, lished or not. The documents may come from émanant des établissements d’enseignement et de teaching and research institutions in France or recherche français ou étrangers, des laboratoires abroad, or from public or private research centers. publics ou privés. Randomly coloring graphs of logarithmically bounded pathwidth Shai Vardi∗ Abstract We consider the problem of sampling a proper k-coloring of a graph of maximal degree ∆ uniformly at random. We describe a new Markov chain for sampling colorings, and show that it mixes rapidly on graphs of logarithmically bounded pathwidth if k ≥ (1 + )∆, for any > 0, using a new hybrid paths argument. ∗California Institute of Technology, Pasadena, CA, 91125, USA. E-mail: [email protected]. 1 Introduction A (proper) k-coloring of a graph G = (V; E) is an assignment σ : V ! f1; : : : ; kg such that neighboring vertices have different colors. We consider the problem of sampling (almost) uniformly at random from the space of all k-colorings of a graph.1 The problem has received considerable attention from the computer science community in recent years, e.g., [12, 17, 24, 26, 33, 44, 45].
  • K-Outerplanar Graphs, Planar Duality, and Low Stretch Spanning Trees

    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.
  • Planar Graph Theory We Say That a Graph Is Planar If It Can Be Drawn in the Plane Without Edges Crossing

    Planar Graph Theory We Say That a Graph Is Planar If It Can Be Drawn in the Plane Without Edges Crossing

    Planar Graph Theory We say that a graph is planar if it can be drawn in the plane without edges crossing. We use the term plane graph to refer to a planar depiction of a planar graph. e.g. K4 is a planar graph Q1: The following is also planar. Find a plane graph version of the graph. A B F E D C A Method that sometimes works for drawing the plane graph for a planar graph: 1. Find the largest cycle in the graph. 2. The remaining edges must be drawn inside/outside the cycle so that they do not cross each other. Q2: Using the method above, find a plane graph version of the graph below. A B C D E F G H non e.g. K3,3: K5 Here are three (plane graph) depictions of the same planar graph: J N M J K J N I M K K I N M I O O L O L L A face of a plane graph is a region enclosed by the edges of the graph. There is also an unbounded face, which is the outside of the graph. Q3: For each of the plane graphs we have drawn, find: V = # of vertices of the graph E = # of edges of the graph F = # of faces of the graph Q4: Do you have a conjecture for an equation relating V, E and F for any plane graph G? Q5: Can you name the 5 Platonic Solids (i.e. regular polyhedra)? (This is a geometry question.) Q6: Find the # of vertices, # of edges and # of faces for each Platonic Solid.
  • Network Analysis of the Multimodal Freight Transportation System in New York City

    Network Analysis of the Multimodal Freight Transportation System in New York City

    Network Analysis of the Multimodal Freight Transportation System in New York City Project Number: 15 – 2.1b Year: 2015 FINAL REPORT June 2018 Principal Investigator Qian Wang Researcher Shuai Tang MetroFreight Center of Excellence University at Buffalo Buffalo, NY 14260-4300 Network Analysis of the Multimodal Freight Transportation System in New York City ABSTRACT The research is aimed at examining the multimodal freight transportation network in the New York metropolitan region to identify critical links, nodes and terminals that affect last-mile deliveries. Two types of analysis were conducted to gain a big picture of the region’s freight transportation network. First, three categories of network measures were generated for the highway network that carries the majority of last-mile deliveries. They are the descriptive measures that demonstrate the basic characteristics of the highway network, the network structure measures that quantify the connectivity of nodes and links, and the accessibility indices that measure the ease to access freight demand, services and activities. Second, 71 multimodal freight terminals were selected and evaluated in terms of their accessibility to major multimodal freight demand generators such as warehousing establishments. As found, the most important highways nodes that are critical in terms of connectivity and accessibility are those in and around Manhattan, particularly the bridges and tunnels connecting Manhattan to neighboring areas. Major multimodal freight demand generators, such as warehousing establishments, have better accessibility to railroad and marine port terminals than air and truck terminals in general. The network measures and findings in the research can be used to understand the inventory of the freight network in the system and to conduct freight travel demand forecasting analysis.
  • Density Theorems for Bipartite Graphs and Related Ramsey-Type Results

    Density Theorems for Bipartite Graphs and Related Ramsey-Type Results

    Density theorems for bipartite graphs and related Ramsey-type results Jacob Fox Benny Sudakov Princeton UCLA and IAS Ramsey’s theorem Definition: r(G) is the minimum N such that every 2-edge-coloring of the complete graph KN contains a monochromatic copy of graph G. Theorem: (Ramsey-Erdos-Szekeres,˝ Erdos)˝ t/2 2t 2 ≤ r(Kt ) ≤ 2 . Question: (Burr-Erd˝os1975) How large is r(G) for a sparse graph G on n vertices? Ramsey numbers for sparse graphs Conjecture: (Burr-Erd˝os1975) For every d there exists a constant cd such that if a graph G has n vertices and maximum degree d, then r(G) ≤ cd n. Theorem: 1 (Chv´atal-R¨odl-Szemer´edi-Trotter 1983) cd exists. 2αd 2 (Eaton 1998) cd ≤ 2 . βd αd log2 d 3 (Graham-R¨odl-Ruci´nski2000) 2 ≤ cd ≤ 2 . Moreover, if G is bipartite, r(G) ≤ 2αd log d n. Density theorem for bipartite graphs Theorem: (F.-Sudakov) Let G be a bipartite graph with n vertices and maximum degree d 2 and let H be a bipartite graph with parts |V1| = |V2| = N and εN edges. If N ≥ 8dε−d n, then H contains G. Corollary: For every bipartite graph G with n vertices and maximum degree d, r(G) ≤ d2d+4n. (D. Conlon independently proved that r(G) ≤ 2(2+o(1))d n.) Proof: Take ε = 1/2 and H to be the graph of the majority color. Ramsey numbers for cubes Definition: d The binary cube Qd has vertex set {0, 1} and x, y are adjacent if x and y differ in exactly one coordinate.
  • Constrained Representations of Map Graphs and Half-Squares

    Constrained Representations of Map Graphs and Half-Squares

    Constrained Representations of Map Graphs and Half-Squares Hoang-Oanh Le Berlin, Germany [email protected] Van Bang Le Universität Rostock, Institut für Informatik, Rostock, Germany [email protected] Abstract The square of a graph H, denoted H2, is obtained from H by adding new edges between two distinct vertices whenever their distance in H is two. The half-squares of a bipartite graph B = (X, Y, EB ) are the subgraphs of B2 induced by the color classes X and Y , B2[X] and B2[Y ]. For a given graph 2 G = (V, EG), if G = B [V ] for some bipartite graph B = (V, W, EB ), then B is a representation of G and W is the set of points in B. If in addition B is planar, then G is also called a map graph and B is a witness of G [Chen, Grigni, Papadimitriou. Map graphs. J. ACM, 49 (2) (2002) 127-138]. While Chen, Grigni, Papadimitriou proved that any map graph G = (V, EG) has a witness with at most 3|V | − 6 points, we show that, given a map graph G and an integer k, deciding if G admits a witness with at most k points is NP-complete. As a by-product, we obtain NP-completeness of edge clique partition on planar graphs; until this present paper, the complexity status of edge clique partition for planar graphs was previously unknown. We also consider half-squares of tree-convex bipartite graphs and prove the following complexity 2 dichotomy: Given a graph G = (V, EG) and an integer k, deciding if G = B [V ] for some tree-convex bipartite graph B = (V, W, EB ) with |W | ≤ k points is NP-complete if G is non-chordal dually chordal and solvable in linear time otherwise.
  • Minimal Acyclic Forbidden Minors for the Family of Graphs with Bounded Path-Width

    Minimal Acyclic Forbidden Minors for the Family of Graphs with Bounded Path-Width

    Discrete Mathematics 127 (1994) 293-304 293 North-Holland Minimal acyclic forbidden minors for the family of graphs with bounded path-width Atsushi Takahashi, Shuichi Ueno and Yoji Kajitani Department of Electrical and Electronic Engineering, Tokyo Institute of Technology. Tokyo, 152. Japan Received 27 November 1990 Revised 12 February 1992 Abstract The graphs with bounded path-width, introduced by Robertson and Seymour, and the graphs with bounded proper-path-width, introduced in this paper, are investigated. These families of graphs are minor-closed. We characterize the minimal acyclic forbidden minors for these families of graphs. We also give estimates for the numbers of minimal forbidden minors and for the numbers of vertices of the largest minimal forbidden minors for these families of graphs. 1. Introduction Graphs we consider are finite and undirected, but may have loops and multiple edges unless otherwise specified. A graph H is a minor of a graph G if H is isomorphic to a graph obtained from a subgraph of G by contracting edges. A family 9 of graphs is said to be minor-closed if the following condition holds: If GEB and H is a minor of G then H EF. A graph G is a minimal forbidden minor for a minor-closed family F of graphs if G#8 and any proper minor of G is in 9. Robertson and Seymour proved the following deep theorems. Theorem 1.1 (Robertson and Seymour [15]). Every minor-closed family of graphs has a finite number of minimal forbidden minors. Theorem 1.2 (Robertson and Seymour [14]).
  • 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

    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.
  • Maximum and Minimum Degree in Iterated Line Graphs by Manu

    Maximum and Minimum Degree in Iterated Line Graphs by Manu

    Maximum and minimum degree in iterated line graphs by Manu Aggarwal A thesis submitted to the Graduate Faculty of Auburn University in partial fulfillment of the requirements for the Degree of Master of Science Auburn, Alabama August 3, 2013 Keywords: iterated line graphs, maximum degree, minimum degree Approved by Dean Hoffman, Professor of Mathematics Chris Rodger, Professor of Mathematics Andras Bezdek, Professor of Mathematics Narendra Govil, Professor of Mathematics Abstract In this thesis we analyze two papers, both by Dr.Stephen G. Hartke and Dr.Aparna W. Higginson, on maximum [2] and minimum [3] degrees of a graph G under iterated line graph operations. Let ∆k and δk denote the minimum and the maximum degrees, respectively, of the kth iterated line graph Lk(G). It is shown that if G is not a path, then, there exist integers A and B such that for all k > A, ∆k+1 = 2∆k − 2 and for all k > B, δk+1 = 2δk − 2. ii Table of Contents Abstract . ii List of Figures . iv 1 Introduction . .1 2 An elementary result . .3 3 Maximum degree growth in iterated line graphs . 10 4 Minimum degree growth in iterated line graphs . 26 5 A puzzle . 45 Bibliography . 46 iii List of Figures 1.1 ............................................1 2.1 ............................................4 2.2 : Disappearing vertex of degree two . .5 2.3 : Disappearing leaf . .7 3.1 ............................................ 11 3.2 ............................................ 12 3.3 ............................................ 13 3.4 ............................................ 14 3.5 ............................................ 15 3.6 : When CD is not a single vertex . 17 3.7 : When CD is a single vertex . 18 4.1 ...........................................