DOCSLIB.ORG

Introduction to Treewidth

Total Page：16

File Type：pdf, Size：1020Kb

Download full-text PDF Read full-text
Introduction to Treewidth Introduction to Treewidth Marcin Pilipczuk most slides by Łukasz Kowalik some slides by Marek Cygan and Michał Pilipczuk Algorytmika, 11.05.2020r. Marcin Pilipczuk (UW) Introduction to treewidth 1 / 34 Treewidth Marcin Pilipczuk (UW) Introduction to treewidth 2 / 34 The book Contained in Chapter 7 of http://parameterized-algorithms.mimuw.edu.pl Marcin Pilipczuk (UW) Introduction to treewidth 3 / 34 I Principle of dynamic programming. NP-hard in general, tractable in many special cases. Easy exercise: linear-time algorithm on trees. Motivation of treewidth Independent Set: given a graph with vertex weights, find the maximum weight of a subset of vertices that are pairwise non-adjacent. Marcin Pilipczuk (UW) Introduction to treewidth 4 / 34 I Principle of dynamic programming. Easy exercise: linear-time algorithm on trees. Motivation of treewidth Independent Set: given a graph with vertex weights, find the maximum weight of a subset of vertices that are pairwise non-adjacent. NP-hard in general, tractable in many special cases. Marcin Pilipczuk (UW) Introduction to treewidth 4 / 34 I Principle of dynamic programming. Motivation of treewidth Independent Set: given a graph with vertex weights, find the maximum weight of a subset of vertices that are pairwise non-adjacent. NP-hard in general, tractable in many special cases. Easy exercise: linear-time algorithm on trees. Marcin Pilipczuk (UW) Introduction to treewidth 4 / 34 Motivation of treewidth Independent Set: given a graph with vertex weights, find the maximum weight of a subset of vertices that are pairwise non-adjacent. NP-hard in general, tractable in many special cases. Easy exercise: linear-time algorithm on trees. I Principle of dynamic programming. Marcin Pilipczuk (UW) Introduction to treewidth 4 / 34 I A[u]: maximum weight of an IS in Tu. I B[u]: maximum weight of an IS in Tu that contains u. I C[u]: maximum weight of an IS in Tu that excludes u. I A[u] = max(B[u]; C[u]). P I B[u] = w(u) + v2chld(u) C[v]. P I C[u] = v2chld(u) A[v]. I Tu is the subtree rooted at u. Compute dynamic programming tables: Recursive formulas: Answer: A[r]. u Weighted Independent Set on trees Root the tree in an arbitrary vertex r. Marcin Pilipczuk (UW) Introduction to treewidth 5 / 34 I A[u]: maximum weight of an IS in Tu. I B[u]: maximum weight of an IS in Tu that contains u. I C[u]: maximum weight of an IS in Tu that excludes u. I A[u] = max(B[u]; C[u]). P I B[u] = w(u) + v2chld(u) C[v]. P I C[u] = v2chld(u) A[v]. Compute dynamic programming tables: Recursive formulas: Answer: A[r]. Weighted Independent Set on trees Root the tree in an arbitrary vertex r. I Tu is the subtree rooted at u. u Marcin Pilipczuk (UW) Introduction to treewidth 5 / 34 I A[u] = max(B[u]; C[u]). P I B[u] = w(u) + v2chld(u) C[v]. P I C[u] = v2chld(u) A[v]. I A[u]: maximum weight of an IS in Tu. I B[u]: maximum weight of an IS in Tu that contains u. I C[u]: maximum weight of an IS in Tu that excludes u. Recursive formulas: Answer: A[r]. Weighted Independent Set on trees Root the tree in an arbitrary vertex r. I Tu is the subtree rooted at u. Compute dynamic programming tables: u Marcin Pilipczuk (UW) Introduction to treewidth 5 / 34 I A[u] = max(B[u]; C[u]). P I B[u] = w(u) + v2chld(u) C[v]. P I C[u] = v2chld(u) A[v]. I B[u]: maximum weight of an IS in Tu that contains u. I C[u]: maximum weight of an IS in Tu that excludes u. Recursive formulas: Answer: A[r]. Weighted Independent Set on trees Root the tree in an arbitrary vertex r. I Tu is the subtree rooted at u. Compute dynamic programming tables: I A[u]: maximum weight of an IS in Tu. u Marcin Pilipczuk (UW) Introduction to treewidth 5 / 34 I A[u] = max(B[u]; C[u]). P I B[u] = w(u) + v2chld(u) C[v]. P I C[u] = v2chld(u) A[v]. I C[u]: maximum weight of an IS in Tu that excludes u. Recursive formulas: Answer: A[r]. Weighted Independent Set on trees Root the tree in an arbitrary vertex r. I Tu is the subtree rooted at u. Compute dynamic programming tables: I A[u]: maximum weight of an IS in Tu. I B[u]: maximum weight of an IS in Tu that contains u. u Marcin Pilipczuk (UW) Introduction to treewidth 5 / 34 I A[u] = max(B[u]; C[u]). P I B[u] = w(u) + v2chld(u) C[v]. P I C[u] = v2chld(u) A[v]. Recursive formulas: Answer: A[r]. Weighted Independent Set on trees Root the tree in an arbitrary vertex r. I Tu is the subtree rooted at u. Compute dynamic programming tables: I A[u]: maximum weight of an IS in Tu. I B[u]: maximum weight of an IS in Tu that contains u. I C[u]: maximum weight of an IS in Tu that excludes u. u Marcin Pilipczuk (UW) Introduction to treewidth 5 / 34 I A[u] = max(B[u]; C[u]). P I B[u] = w(u) + v2chld(u) C[v]. P I C[u] = v2chld(u) A[v]. Answer: A[r]. Weighted Independent Set on trees Root the tree in an arbitrary vertex r. I Tu is the subtree rooted at u. Compute dynamic programming tables: I A[u]: maximum weight of an IS in Tu. I B[u]: maximum weight of an IS in Tu that contains u. I C[u]: maximum weight of an IS in Tu that excludes u. Recursive formulas: u Marcin Pilipczuk (UW) Introduction to treewidth 5 / 34 P I B[u] = w(u) + v2chld(u) C[v]. P I C[u] = v2chld(u) A[v]. Answer: A[r]. Weighted Independent Set on trees Root the tree in an arbitrary vertex r. I Tu is the subtree rooted at u. Compute dynamic programming tables: I A[u]: maximum weight of an IS in Tu. I B[u]: maximum weight of an IS in Tu that contains u. I C[u]: maximum weight of an IS in Tu that excludes u. Recursive formulas: I A[u] = max(B[u]; C[u]). u Marcin Pilipczuk (UW) Introduction to treewidth 5 / 34 P I C[u] = v2chld(u) A[v]. Answer: A[r]. Weighted Independent Set on trees Root the tree in an arbitrary vertex r. I Tu is the subtree rooted at u. Compute dynamic programming tables: I A[u]: maximum weight of an IS in Tu. I B[u]: maximum weight of an IS in Tu that contains u. I C[u]: maximum weight of an IS in Tu that excludes u. Recursive formulas: I A[u] = max(B[u]; C[u]). P I B[u] = w(u) + v2chld(u) C[v]. u Marcin Pilipczuk (UW) Introduction to treewidth 5 / 34 Answer: A[r]. Weighted Independent Set on trees Root the tree in an arbitrary vertex r. I Tu is the subtree rooted at u. Compute dynamic programming tables: I A[u]: maximum weight of an IS in Tu. I B[u]: maximum weight of an IS in Tu that contains u. I C[u]: maximum weight of an IS in Tu that excludes u. Recursive formulas: I A[u] = max(B[u]; C[u]). P I B[u] = w(u) + v2chld(u) C[v]. P I C[u] = v2chld(u) A[v]. u Marcin Pilipczuk (UW) Introduction to treewidth 5 / 34 Weighted Independent Set on trees Root the tree in an arbitrary vertex r. I Tu is the subtree rooted at u. Compute dynamic programming tables: I A[u]: maximum weight of an IS in Tu. I B[u]: maximum weight of an IS in Tu that contains u. I C[u]: maximum weight of an IS in Tu that excludes u. Recursive formulas: I A[u] = max(B[u]; C[u]). P I B[u] = w(u) + v2chld(u) C[v]. P I C[u] = v2chld(u) A[v]. Answer: A[r]. u Marcin Pilipczuk (UW) Introduction to treewidth 5 / 34 Independent Set on trees: Why does the DP work? Very limited dependence between vertices Essential information about subtree stored in a compact way. u Marcin Pilipczuk (UW) Introduction to treewidth 6 / 34 Generalizations of paths and trees path pathlike Pathwidth Graph of small pathwidth is path-like. We hope that problems tractable on paths are also tractable on graphs of small pathwidth. Marcin Pilipczuk (UW) Introduction to treewidth 7 / 34 Generalizations of paths and trees tree treelike Treewidth Graph of small treewidth is tree-like. We hope that problems tractable on trees are also tractable on graphs of small treewidth. Marcin Pilipczuk (UW) Introduction to treewidth 7 / 34 Generalizations of paths and trees tree treelike Treewidth Graph of small treewidth is tree-like. We hope that problems tractable on trees are also tractable on graphs of small treewidth. Marcin Pilipczuk (UW) Introduction to treewidth 7 / 34 Introduction Crucial property of small pathwidth/treewidth graphs: separators. Marcin Pilipczuk (UW) Introduction to treewidth 8 / 34 Introduction Crucial property of small pathwidth/treewidth graphs: separators. Marcin Pilipczuk (UW) Introduction to treewidth 8 / 34 Introduction Crucial property of small pathwidth/treewidth graphs: separators. Marcin Pilipczuk (UW) Introduction to treewidth 8 / 34 Introduction Crucial property of small pathwidth/treewidth graphs: separators. Marcin Pilipczuk (UW) Introduction to treewidth 8 / 34 Introduction Crucial property of small pathwidth/treewidth graphs: separators.
Load more

Recommended publications
  • 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.
    [Show full text]
  • Treewidth I (Algorithms and Networks)
    Treewidth Algorithms and Networks Overview • Historic introduction: Series parallel graphs • Dynamic programming on trees • Dynamic programming on series parallel graphs • Treewidth • Dynamic programming on graphs of small treewidth • Finding tree decompositions 2 Treewidth Computing the Resistance With the Laws of Ohm = + 1 1 1 1789-1854 R R1 R2 = + R R1 R2 R1 R2 R1 Two resistors in series R2 Two resistors in parallel 3 Treewidth Repeated use of the rules 6 6 5 2 2 1 7 Has resistance 4 1/6 + 1/2 = 1/(1.5) 1.5 + 1.5 + 5 = 8 1 + 7 = 8 1/8 + 1/8 = 1/4 4 Treewidth 5 6 6 5 2 2 1 7 A tree structure tree A 5 6 P S 2 P 6 P 2 7 S Treewidth 1 Carry on! • Internal structure of 6 6 5 graph can be forgotten 2 2 once we know essential information 1 7 about it! 4 ¼ + ¼ = ½ 6 Treewidth Using tree structures for solving hard problems on graphs 1 • Network is ‘series parallel graph’ • 196*, 197*: many problems that are hard for general graphs are easy for e.g.: – Trees NP-complete – Series parallel graphs • Many well-known problems Linear / polynomial time computable 7 Treewidth Weighted Independent Set • Independent set: set of vertices that are pair wise non-adjacent. • Weighted independent set – Given: Graph G=(V,E), weight w(v) for each vertex v. – Question: What is the maximum total weight of an independent set in G? • NP-complete 8 Treewidth Weighted Independent Set on Trees • On trees, this problem can be solved in linear time with dynamic programming.
    [Show full text]
  • 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].
    [Show full text]
  • Bandwidth, Expansion, Treewidth, Separators and Universality for Bounded-Degree Graphs$
    View metadata, citation and similar papers at core.ac.uk brought to you by CORE provided by Elsevier - Publisher Connector European Journal of Combinatorics 31 (2010) 1217–1227 Contents lists available at ScienceDirect European Journal of Combinatorics journal homepage: www.elsevier.com/locate/ejc Bandwidth, expansion, treewidth, separators and universality for bounded-degree graphsI Julia Böttcher a, Klaas P. Pruessmann b, Anusch Taraz a, Andreas Würfl a a Zentrum Mathematik, Technische Universität München, Boltzmannstraße 3, D-85747 Garching bei München, Germany b Institute for Biomedical Engineering, University and ETH Zurich, Gloriastr. 35, 8092, Zürich, Switzerland article info a b s t r a c t Article history: We establish relations between the bandwidth and the treewidth Received 3 March 2009 of bounded degree graphs G, and relate these parameters to the size Accepted 13 October 2009 of a separator of G as well as the size of an expanding subgraph of Available online 24 October 2009 G. Our results imply that if one of these parameters is sublinear in the number of vertices of G then so are all the others. This implies for example that graphs of fixed genus have sublinear bandwidth or, more generally, a corresponding result for graphs with any fixed forbidden minor. As a consequence we establish a simple criterion for universality for such classes of graphs and show for example that for each γ > 0 every n-vertex graph with minimum degree 3 C . 4 γ /n contains a copy of every bounded-degree planar graph on n vertices if n is sufficiently large. ' 2009 Elsevier Ltd.
    [Show full text]
  • 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]).
    [Show full text]
  • Arxiv:2006.06067V2 [Math.CO] 4 Jul 2021
    Treewidth versus clique number. I. Graph classes with a forbidden structure∗† Cl´ement Dallard1 Martin Milaniˇc1 Kenny Storgelˇ 2 1 FAMNIT and IAM, University of Primorska, Koper, Slovenia 2 Faculty of Information Studies, Novo mesto, Slovenia [email protected] [email protected] [email protected] Treewidth is an important graph invariant, relevant for both structural and algo- rithmic reasons. A necessary condition for a graph class to have bounded treewidth is the absence of large cliques. We study graph classes closed under taking induced subgraphs in which this condition is also sufficient, which we call (tw,ω)-bounded. Such graph classes are known to have useful algorithmic applications related to variants of the clique and k-coloring problems. We consider six well-known graph containment relations: the minor, topological minor, subgraph, induced minor, in- duced topological minor, and induced subgraph relations. For each of them, we give a complete characterization of the graphs H for which the class of graphs excluding H is (tw,ω)-bounded. Our results yield an infinite family of χ-bounded induced-minor-closed graph classes and imply that the class of 1-perfectly orientable graphs is (tw,ω)-bounded, leading to linear-time algorithms for k-coloring 1-perfectly orientable graphs for every fixed k. This answers a question of Breˇsar, Hartinger, Kos, and Milaniˇc from 2018, and one of Beisegel, Chudnovsky, Gurvich, Milaniˇc, and Servatius from 2019, respectively. We also reveal some further algorithmic implications of (tw,ω)- boundedness related to list k-coloring and clique problems. In addition, we propose a question about the complexity of the Maximum Weight Independent Set prob- lem in (tw,ω)-bounded graph classes and prove that the problem is polynomial-time solvable in every class of graphs excluding a fixed star as an induced minor.
    [Show full text]
  • Arxiv:1602.02002V1 [Math.CO] 5 Feb 2016 Dept
    a The Structure of W4-Immersion-Free Graphs R´emy Belmonteb;c Archontia Giannopouloud;e Daniel Lokshtanovf ;g Dimitrios M. Thilikosh;i ;j Abstract We study the structure of graphs that do not contain the wheel on 5 vertices W4 as an immersion, and show that these graphs can be constructed via 1, 2, and 3-edge-sums from subcubic graphs and graphs of bounded treewidth. Keywords: Immersion Relation, Wheel, Treewidth, Edge-sums, Structural Theorems 1 Introduction A recurrent theme in structural graph theory is the study of specific properties that arise in graphs when excluding a fixed pattern. The notion of appearing as a pattern gives rise to various graph containment relations. Maybe the most famous example is the minor relation that has been widely studied, in particular since the fundamental results of Kuratowski and Wagner who proved that planar graphs are exactly those graphs that contain neither K5 nor K3;3 as a (topological) minor. A graph G contains a graph H as a topological minor if H can be obtained from G by a sequence of vertex deletions, edge deletions and replacing internally vertex-disjoint paths by single edges. Wagner also described the structure of the graphs that exclude K5 as a minor: he proved that K5- minor-free graphs can be constructed by \gluing" together (using so-called clique-sums) planar graphs and a specific graph on 8 vertices, called Wagner's graph. aEmails of authors: [email protected] [email protected], [email protected], [email protected] b arXiv:1602.02002v1 [math.CO] 5 Feb 2016 Dept.
    [Show full text]
  • Handout on Vertex Separators and Low Tree-Width K-Partition
    Handout on vertex separators and low tree-width k-partition January 12 and 19, 2012 Given a graph G(V; E) and a set of vertices S ⊂ V , an S-flap is the set of vertices in a connected component of the graph induced on V n S. A set S is a vertex separator if no S-flap has more than n=p 2 vertices. Lipton and Tarjan showed that every planar graph has a separator of size O( n). This was generalized by Alon, Seymour and Thomas to any family of graphs that excludes some fixed (arbitrary) subgraph H as a minor. Theorem 1 There a polynomial time algorithm that given a parameter h and an n vertex graphp G(V; E) either outputs a Kh minor, or outputs a vertex separator of size at most h hn. Corollary 2 Let G(V; E) be an arbitrary graph with nop Kh minor, and let W ⊂ V . Then one can find in polynomial time a set S of at most h hn vertices such that every S-flap contains at most jW j=2 vertices from W . Proof: The proof given in class for Theorem 1 easily extends to this setting. 2 p Corollary 3 Every graph with no Kh as a minor has treewidth O(h hn). Moreover, a tree decomposition with this treewidth can be found in polynomial time. Proof: We have seen an algorithm that given a graph of treewidth p constructs a tree decomposition of treewidth 8p. Usingp Corollary 2, that algorithm can be modified to give a tree decomposition of treewidth 8h hn in our case, and do so in polynomial time.
    [Show full text]
  • The Structure of Graphs Not Topologically Containing the Wagner Graph
    The structure of graphs not topologically containing the Wagner graph John Maharry, Neil Robertson1 Department of Mathematics The Ohio State University Columbus, OH USA [email protected], [email protected] Abstract A structural characterization of graphs not containing the Wagner graph, also known as V8, is shown. The result was announced in 1979 by the second author, but until now a proof has not been published. Keywords: Wagner graph, V8 graph, Excluded-minor 1. Introduction Graphs in this paper are finite and have no loops or multiple edges. Given a graph G, one can obtain a contraction K of G by contracting pairwise dis- joint connected induced subgraphs to single (distinct) vertices where distinct vertices of K are adjacent if and only if there exists an edge of G with an end- vertex in each of the corresponding subgraphs of G. A graph M is a minor of a graph G when M is a contraction of a subgraph of G. We write H ≤m G when H is isomorphic to a minor M of G. Given an edge e 2 E(G) with endvertices x and y, we define the single-edge contraction to be the graph formed by contracting the edge e to a new vertex, call it z. An equivalent definition of minor inclusion of a graph is H ≤m G if and only if H is iso- morphic to a graph obtained by a series of single-edge contractions starting with a subgraph S of G. 1Research funded in part by King Abdulaziz University, 2011 and in part by SERC Visiting Fellowship Research Grant, University of London, 1985 Preprint submitted to Journal Combin.
    [Show full text]
  • Characterizations of Graphs Without Certain Small Minors by J. Zachary
    Characterizations of Graphs Without Certain Small Minors By J. Zachary Gaslowitz Dissertation Submitted to the Faculty of the Graduate School of Vanderbilt University in partial fulfillment of the requirements for the degree of DOCTOR OF PHILOSOPHY in Mathematics May 11, 2018 Nashville, Tennessee Approved: Mark Ellingham, Ph.D. Paul Edelman, Ph.D. Bruce Hughes, Ph.D. Mike Mihalik, Ph.D. Jerry Spinrad, Ph.D. Dong Ye, Ph.D. TABLE OF CONTENTS Page 1 Introduction . 2 2 Previous Work . 5 2.1 Planar Graphs . 5 2.2 Robertson and Seymour's Graph Minor Project . 7 2.2.1 Well-Quasi-Orderings . 7 2.2.2 Tree Decomposition and Treewidth . 8 2.2.3 Grids and Other Graphs with Large Treewidth . 10 2.2.4 The Structure Theorem and Graph Minor Theorem . 11 2.3 Graphs Without K2;t as a Minor . 15 2.3.1 Outerplanar and K2;3-Minor-Free Graphs . 15 2.3.2 Edge-Density for K2;t-Minor-Free Graphs . 16 2.3.3 On the Structure of K2;t-Minor-Free Graphs . 17 3 Algorithmic Aspects of Graph Minor Theory . 21 3.1 Theoretical Results . 21 3.2 Practical Graph Minor Containment . 22 4 Characterization and Enumeration of 4-Connected K2;5-Minor-Free Graphs 25 4.1 Preliminary Definitions . 25 4.2 Characterization . 30 4.3 Enumeration . 38 5 Characterization of Planar 4-Connected DW6-minor-free Graphs . 51 6 Future Directions . 91 BIBLIOGRAPHY . 93 1 Chapter 1 Introduction All graphs in this paper are finite and simple. Given a graph G, the vertex set of G is denoted V (G) and the edge set is denoted E(G).
    [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]
  • Separator Theorems and Turán-Type Results for Planar Intersection Graphs
    SEPARATOR THEOREMS AND TURAN-TYPE¶ RESULTS FOR PLANAR INTERSECTION GRAPHS JACOB FOX AND JANOS PACH Abstract. We establish several geometric extensions of the Lipton-Tarjan separator theorem for planar graphs. For instance, we show that any collection C of Jordan curves in the plane with a total of m p 2 crossings has a partition into three parts C = S [ C1 [ C2 such that jSj = O( m); maxfjC1j; jC2jg · 3 jCj; and no element of C1 has a point in common with any element of C2. These results are used to obtain various properties of intersection patterns of geometric objects in the plane. In particular, we prove that if a graph G can be obtained as the intersection graph of n convex sets in the plane and it contains no complete bipartite graph Kt;t as a subgraph, then the number of edges of G cannot exceed ctn, for a suitable constant ct. 1. Introduction Given a collection C = fγ1; : : : ; γng of compact simply connected sets in the plane, their intersection graph G = G(C) is a graph on the vertex set C, where γi and γj (i 6= j) are connected by an edge if and only if γi \ γj 6= ;. For any graph H, a graph G is called H-free if it does not have a subgraph isomorphic to H. Pach and Sharir [13] started investigating the maximum number of edges an H-free intersection graph G(C) on n vertices can have. If H is not bipartite, then the assumption that G is an intersection graph of compact convex sets in the plane does not signi¯cantly e®ect the answer.
    [Show full text]