DOCSLIB.ORG

Sphere-Cut Decompositions and Dominating Sets in Planar Graphs

Total Page：16

File Type：pdf, Size：1020Kb

Download full-text PDF Read full-text
Sphere-Cut Decompositions and Dominating Sets in Planar Graphs Sphere-cut Decompositions and Dominating Sets in Planar Graphs Michalis Samaris R.N. 201314 Scientific committee: Dimitrios M. Thilikos, Professor, Dep. of Mathematics, National and Kapodistrian University of Athens. Supervisor: Stavros G. Kolliopoulos, Dimitrios M. Thilikos, Associate Professor, Professor, Dep. of Informatics and Dep. of Mathematics, National and Telecommunications, National and Kapodistrian University of Athens. Kapodistrian University of Athens. white Lefteris M. Kirousis, Professor, Dep. of Mathematics, National and Kapodistrian University of Athens. Aposunjèseic sfairik¸n tom¸n kai σύνοla kuriarqÐac se epÐpeda γραφήματa Miχάλης Σάμαρης A.M. 201314 Τριμελής Epiτροπή: Δημήτρioc M. Jhlυκός, Epiblèpwn: Kajhγητής, Tm. Majhmatik¸n, E.K.P.A. Δημήτρioc M. Jhlυκός, Staύρoc G. Kolliόποuloc, Kajhγητής tou Τμήμatoc Anaπληρωτής Kajhγητής, Tm. Plhroforiκής Majhmatik¸n tou PanepisthmÐou kai Thl/ni¸n, E.K.P.A. Ajhn¸n Leutèrhc M. Kuroύσης, white Kajhγητής, Tm. Majhmatik¸n, E.K.P.A. PerÐlhyh 'Ena σημαντικό apotèlesma sth JewrÐa Γραφημάτwn apoteleÐ h apόdeixh thc eikasÐac tou Wagner από touc Neil Robertson kai Paul D. Seymour. sth σειρά ergasi¸n ‘Ελλάσσοna Γραφήματα’ apo to 1983 e¸c to 2011. H eikasÐa αυτή lèei όti sthn κλάση twn γραφημάtwn den υπάρχει άπειρη antialusÐda ¸c proc th sqèsh twn ελλασόnwn γραφημάτwn. H JewrÐa pou αναπτύχθηκε gia thn απόδειξη αυτής thc eikasÐac eÐqe kai èqei ακόμα σημαντικό antÐktupo tόσο sthn δομική όσο kai sthn algoriθμική JewrÐa Γραφημάτwn, άλλα kai se άλλα pedÐa όπως h Παραμετρική Poλυπλοκόthta. Sta πλάιsia thc απόδειξης oi suggrafeÐc eiσήγαγαν kai nèec paramètrouc πλά- touc. Se autèc ήτan h κλαδοαποσύνθεση kai to κλαδοπλάτoc ενός γραφήματoc. H παράμετρος αυτή χρησιμοποιήθηκε idiaÐtera sto σχεδιασμό algorÐjmwn kai sthn χρήση thc τεχνικής ‘διαίρει kai basÐleue’. Επιπλεόn eiσήχθησαν nèec paremfereÐc ènnoiec όπως oi aposunjèseic sfairik¸n tom¸n pou eÐnai kladoaposunjèseic sthn klash twn epÐpedwn γραφημάτwn pou èqoun κάποιες epiplèon ιδιόthtec. Sthn exèlixh thc èreunac υπήρξαν σημαντικά apotelèsma σχετικά me to klado- πλάτoc sthn κλάση twn epÐpedwn γραφημάτwn. Oi Fedor V. Fomin kai Δημήτριoc M. Θηλυκός apèdeixan όti to κλαδοπλάτoc ενός epÐpedou γραφήματoc me n korufèc eÐnai to poλύ p4:5 n. Βασιζόμενος se autό to apotèlesma, o Dhμήτριoc M. Jh- · λυκός susqètisqe to κλαδοπλάτoc me mia άλλη παράμετρο se epÐpeda γραφήματa, to r-aktiνικό σύνοlo kuriarqÐac. Apèdeixe όti an èna embaptismèno epÐpedo γράφημα èqei r- aktiνικό σύνοlo kuriarqÐac to poλύ k, tόte to kladοπλάtoc tou γραφήματoc ja eÐnai to poλύ r p4:5 k. · · H παρούσα διπλωματική ergasÐa κάνει mia poioτική epèktash tou apotelèsmatoc autoύ. Αποδεικνύουμε όti to παραπάνω όριo mporeÐ na anazhthjeÐ se èna δάσοc pou eÐnai upoγράφημα tou dèntrou miac αποσύνθεσης sfairik¸n tom¸n tou γραφήματoc, όπου to mègejoc tou eÐnai γραμμικό wc proc to k. i Abstract An important result in Graph Theory is the proof of Wagner's Conjecture by Neil Robertson and Paul D. Seymour in Graph Minor Series from 1983 until 2011. This conjecture state that there is no infinite anti-chain in the class of graphs under the minor relation. The theory that was built for the proof of this conjecture had, and continues to have, an important impact not only in structural and algorithmic Graph Theory, but also in other fields such as Parameterized Complexity. In the context of this proof, the authors have introduced some new width parameters. Within these were branchwidth and branch decompositions. This parameter was used for algorithm design via the \divide and conquer" technique. Moreover, the authors have introduced, similar to branch decompositions, concepts such as sphere-cut decompositions which are a special type of branch decomposi- tions in planar graphs that have some additional properties. In the course of the research there was a lot of important results about branch- width in the class of planar graphs. Fedor V. Fomin and Dimitrios M. Thilikos proved that the branchwidth of a n-vertex planar graph is at most p4:5 n. Based · on this result Dimitrios M. Thilikos connected the branchwidth with r-radial dom- inating set which is another parameter in plane graphs. He proved that if a plane graph has an r-radial dominating set of size at most k, then the branchwidth of the graph is at most r p4:5 k. · · The purpose of this thesis is to provide a qualitative extension of this result. What we show is that this upper bound is attained by a number of edges of a sphere-cut decomposition, that is a linear function of k. iii Πρόlogoc H παρούσα διπλωματική ergasÐa ekpoνήθηκε sta plaÐsia thc oλοκλήρωση twn spoud¸n mou sto Metaptuχιακό Prόgramma Logikής, AlgorÐjmwn kai JewrÐa Upologismoύ (M.P.L.A.). Euqarist¸ idiaÐtera ton epiblèponta thc παρούσας ergasÐac, Καθηγητή k. Δημή- trio M. Θηλυκό, gia thn στήριξη pou mou prosèfere, gia to gegoνός oti me eiσήγαγε sto ιδιόμορφο pedÐo thc èreunac αλλά kai gia tic endiafèrousec antiparajèseic se mh majhmatikèc suzhtήσεic. Euqarist¸ ton Καθηγητή k. Leutèrh M. Κυρούση, gia th summetoχή tou sthn τριμελή epiτροπή, gegoνός pou apoteleÐ τιμή gia emèna, thn stήrixh tou kai to ei- likrinèc endiafèron tou gia thn foÐthsh mou sto par¸n metαπτυχιακό pρόgramma. Euqarist¸ ton Αναπληρωτή Καθηγητή k. Stαύρο G. Koλλιόπουλο pou me τιμά me thn summetoχή tou sthn τριμελή epiτροπή αλλά kai gia ton εξαιρετικά endiafèron τρόπο didaskalÐac tou. Euqarist¸ epÐshc ton Δημήτρη Z¸ro gia thn διάθεση tou na βοηθήσει se όti epimèrouc ζήτημα mporeÐ na proèkupte katά thn διάρκεια thc foithshc mou. Ja μπορούσα na γράψω poλλά λόgia gia poλλούς ακόμα anjr¸pouc, επειδή όμως ta praγματικά euqarist¸ eÐnai πράξειc kai όqi oi lÐgec grammèc ενός proλόgou ja proτιμήσω na eÐmai συνοπτικός. Jewr¸ όμως anagkaÐec kai tic παρακάτw anaforèc. Katά th διάρκεια thc foÐthshc mou υπήρξε to ζήτημα thc ananèwshc tou metap- τυχιακού proγράμματoc tou M.P.L.A. pou τελικά den katèsth efiktό. Gia thn ag- wnÐa pou μοιραστήκαμε, kai tic aneparkeÐc, όπως apodeÐqjeikan, prospάθειες na apotrèyoume to gegoνός autό, ja ήθελα na euqarisτήσω touc sumfoithtèc mou. Tèloc den mpor¸ na paraleÐyw na euqariστήσω touc δικούς mou anjr¸pouc gia thn αδιαπραγμάτευτη stήριxh twn epilog¸n mou. Miχάλης Σάμαρης Αθήνα, 14 IounÐou 2016 v Contents 1 Introduction 1 1.1 About graphs . .1 1.2 Main description of our result . .3 1.3 Structure of the thesis . .8 2 Basic definitions and results 11 2.1 Basic definitions . 11 2.2 Basic concepts . 14 2.3 Duality . 16 3 Partially Ordered Sets 19 4 Width-parameters and Decompositions 23 4.1 Branchwidth ............................. 25 4.2 Sphere-cut decompositions. .................... 27 5 Radial Dominating Set 29 6 Weight and Capacity 33 6.1 q-weight . 33 6.2 Before the main proof . 33 7 Main Result 41 7.1 Weakly dominated and strong dominated triconnected components 41 7.2 Main Proof . 42 7.3 Conclusion and further work . 44 vii List of Figures 1.1 The drawing riddle . .1 1.2 A graph G and a sphere-cut decomposition of it. Given that Nei is the sphere-cut obtained by the edge ei of T , we denote by Vi the set of vertices that it meets and ci the cost of the corresponding sphere-cut. Therefore, we have that V = v ; v ; c = 2;V = 1 f 1 3g 1 2 v ; v ; c = 2;V = v ; v ; v ; c = 3;V = v ; v ; c = 2;V = f 1 2g 2 3 f 1 2 3g 3 4 f 2 3g 4 5 v ; v ; v ; c = 3;V = v ; v ; v ; c = 3;V = v ; v ; c = f 1 2 3g 5 6 f 1 3 4g 6 7 f 3 3g 7 2;V = v ; v ; c = 2;V = v ; v ; v ; c = 3;V = v ; v ; v ; c = 8 f 1 4g 8 9 f 2 3 4g 9 10 f 2 3 5g 10 3;V = v ; v ; c = 2;V = v ; v ; c = 2;V = v ; v ; c = 11 f 3 5g 11 12 f 2 5g 12 13 f 4 5g 13 2. The cost of (T; τ) is 3. .5 1.3 Ne9 is drawn with red. .6 1.4 The radial distance between x and y is 4. One of the respective sequences is x; f1; z; f2; y........................6 1.5 The vertices x and y are a 3-radial dominating set in this graph. .7 1.6 The edges with > q correspond to sphere-cuts with cost > q. The edges that have been drawn fat are the edges of the q-core that we have choose. This q-core has 3 connected components with weight 10,4,7 respectively. The weight of the q-core is 21. .8 2.1 Examples of graphs that are used frequently. 12 2.2 A multigraph with one loop and three multiple edges. 14 2.3 A graph and its triconnected components. 15 2.4 An example of a triangulated graph. 16 2.5 A graph drawn with black and its dual with red. 17 2.6 The radial graph of graphs in Figure 2.5. The black vertices are the vertices of G. The red verticesare the vertices of G∗. Observe that all the edges of RG have one black and one red endpoint. 17 ix 3.1 The graph in (d) is minor of the graph in (a) that is obtained by deleting the blue vertices and edges in (b) and contracting the red edges in (c). 20 3.2 The obstruction set of outerplanar graphs, K4 and K2;3....... 21 4.1 A graph G with a tree decomposition of it. As easily can be seen from the decomposition, every bag has at most 3 vertices, so tw(G)=2............................... 24 4.2 A graph G and a branch decomposition of it. 26 6.1 D and D0 are branch decompositions of G2 and G1 respectively, where G = G e.
Load more

Recommended publications
  • Beta Current Flow Centrality for Weighted Networks Konstantin Avrachenkov, Vladimir Mazalov, Bulat Tsynguev
    Beta Current Flow Centrality for Weighted Networks Konstantin Avrachenkov, Vladimir Mazalov, Bulat Tsynguev To cite this version: Konstantin Avrachenkov, Vladimir Mazalov, Bulat Tsynguev. Beta Current Flow Centrality for Weighted Networks. 4th International Conference on Computational Social Networks (CSoNet 2015), Aug 2015, Beijing, China. pp.216-227, 10.1007/978-3-319-21786-4_19. hal-01258658 HAL Id: hal-01258658 https://hal.inria.fr/hal-01258658 Submitted on 19 Jan 2016 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. Beta Current Flow Centrality for Weighted Networks Konstantin E. Avrachenkov1, Vladimir V. Mazalov2, Bulat T. Tsynguev3 1 INRIA, 2004 Route des Lucioles, Sophia-Antipolis, France [email protected] 2 Institute of Applied Mathematical Research, Karelian Research Center, Russian Academy of Sciences, 11, Pushkinskaya st., Petrozavodsk, Russia, 185910 [email protected] 3 Transbaikal State University, 30, Aleksandro-Zavodskaya st., Chita, Russia, 672039 [email protected] Abstract. Betweenness centrality is one of the basic concepts in the analysis of social networks. Initial definition for the betweenness of a node in a graph is based on the fraction of the number of geodesics (shortest paths) between any two nodes that given node lies on, to the total number of the shortest paths connecting these nodes.
    [Show full text]
  • 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]
  • Graph Varieties Axiomatized by Semimedial, Medial, and Some Other Groupoid Identities
    Discussiones Mathematicae General Algebra and Applications 40 (2020) 143–157 doi:10.7151/dmgaa.1344 GRAPH VARIETIES AXIOMATIZED BY SEMIMEDIAL, MEDIAL, AND SOME OTHER GROUPOID IDENTITIES Erkko Lehtonen Technische Universit¨at Dresden Institut f¨ur Algebra 01062 Dresden, Germany e-mail: [email protected] and Chaowat Manyuen Department of Mathematics, Faculty of Science Khon Kaen University Khon Kaen 40002, Thailand e-mail: [email protected] Abstract Directed graphs without multiple edges can be represented as algebras of type (2, 0), so-called graph algebras. A graph is said to satisfy an identity if the corresponding graph algebra does, and the set of all graphs satisfying a set of identities is called a graph variety. We describe the graph varieties axiomatized by certain groupoid identities (medial, semimedial, autodis- tributive, commutative, idempotent, unipotent, zeropotent, alternative). Keywords: graph algebra, groupoid, identities, semimediality, mediality. 2010 Mathematics Subject Classification: 05C25, 03C05. 1. Introduction Graph algebras were introduced by Shallon [10] in 1979 with the purpose of providing examples of nonfinitely based finite algebras. Let us briefly recall this concept. Given a directed graph G = (V, E) without multiple edges, the graph algebra associated with G is the algebra A(G) = (V ∪ {∞}, ◦, ∞) of type (2, 0), 144 E. Lehtonen and C. Manyuen where ∞ is an element not belonging to V and the binary operation ◦ is defined by the rule u, if (u, v) ∈ E, u ◦ v := (∞, otherwise, for all u, v ∈ V ∪ {∞}. We will denote the product u ◦ v simply by juxtaposition uv. Using this representation, we may view any algebraic property of a graph algebra as a property of the graph with which it is associated.
    [Show full text]
  • General Approach to Line Graphs of Graphs 1
    DEMONSTRATIO MATHEMATICA Vol. XVII! No 2 1985 Antoni Marczyk, Zdzislaw Skupien GENERAL APPROACH TO LINE GRAPHS OF GRAPHS 1. Introduction A unified approach to the notion of a line graph of general graphs is adopted and proofs of theorems announced in [6] are presented. Those theorems characterize five different types of line graphs. Both Krausz-type and forbidden induced sub- graph characterizations are provided. So far other authors introduced and dealt with single spe- cial notions of a line graph of graphs possibly belonging to a special subclass of graphs. In particular, the notion of a simple line graph of a simple graph is implied by a paper of Whitney (1932). Since then it has been repeatedly introduc- ed, rediscovered and generalized by many authors, among them are Krausz (1943), Izbicki (1960$ a special line graph of a general graph), Sabidussi (1961) a simple line graph of a loop-free graph), Menon (1967} adjoint graph of a general graph) and Schwartz (1969; interchange graph which coincides with our line graph defined below). In this paper we follow another way, originated in our previous work [6]. Namely, we distinguish special subclasses of general graphs and consider five different types of line graphs each of which is defined in a natural way. Note that a similar approach to the notion of a line graph of hypergraphs can be adopted. We consider here the following line graphsi line graphs, loop-free line graphs, simple line graphs, as well as augmented line graphs and augmented loop-free line graphs. - 447 - 2 A. Marczyk, Z.
    [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]
  • Nowhere-Zero Flows in Regular Matroids and Hadwiger's Conjecture
    NOWHERE-ZERO FLOWS IN REGULAR MATROIDS AND HADWIGER'S CONJECTURE LUIS A. GODDYN AND WINFRIED HOCHSTATTLER¨ To the memory of Reinhard B¨orger Abstract. We present a tool that shows, that the existence of a k-nowhere-zero-flow is compatible with 1-,2- and 3-sums in regular matroids. As application we present a conjecture for regular matroids that is equivalent to Hadwiger's conjecture for graphs and Tuttes's 4- and 5-flow conjectures. Keywords: nowhere zero flow, regular matroid, chromatic number, flow number, total unimodularity 1. Introduction A (real) matrix is totally unimodular (TUM) if each subdeterminant belongs to f0; ±1g. Totally unimodular matrices enjoy several nice properties which give them a fundamental role in combinatorial optimization and matroid theory. In this note we prove that the TUM possesses an attractive property. Let S ⊆ R, and let A be a real matrix. A column vector f is a S-flow of A if Af = 0 and every entry of f is a member of ±S. For any additive abelian group Γ use the notation Γ∗ = Γ n f0g. For a TUM A and a column vector f with entries in Γ, the product Af is a well defined column vector with entries in Γ, by interpreting (−1)γ to be the additive inverse of γ. It is convenient to use the language of matroids. A regular oriented matroid M is an oriented matroid that is representable M = M[A] by a TUM matrix A. Here the elements E(M) of M label the columns of A. Each (signed) cocircuit D = (D+;D−) of M corresponds to a f0; ±1g-valued vector in the row space of A and having minimal support.
    [Show full text]
  • P2k-Factorization of Complete Bipartite Multigraphs
    P2k-factorization of complete bipartite multigraphs Beiliang Du Department of Mathematics Suzhou University Suzhou 215006 People's Republic of China Abstract We show that a necessary and sufficient condition for the existence of a P2k-factorization of the complete bipartite- multigraph )"Km,n is m = n == 0 (mod k(2k - l)/d), where d = gcd()", 2k - 1). 1. Introduction Let Km,n be the complete bipartite graph with two partite sets having m and n vertices respectively. The graph )"Km,n is the disjoint union of ).. graphs each isomorphic to Km,n' A subgraph F of )"Km,n is called a spanning subgraph of )"Km,n if F contains all the vertices of )"Km,n' It is clear that a graph with no isolated vertices is uniquely determined by the set of its edges. So in this paper, we consider a graph with no isolated vertices to be a set of 2-element subsets of its vertices. For positive integer k, a path on k vertices is denoted by Pk. A Pk-factor of )'Km,n is a spanning subgraph F of )"Km,n such that every component of F is a Pk and every pair of Pk's have no vertex in common. A Pk-factorization of )"Km,n is a set of edge-disjoint Pk-factors of )"Km,n which is a partition of the set of edges of )'Km,n' (In paper [4] a Pk-factorization of )"Km,n is defined to be a resolvable (m, n, k,)..) bipartite Pk design.) The multigraph )"Km,n is called Ph-factorable whenever it has a Ph-factorization.
    [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]
  • Trees and Graphs
    Module 8: Trees and Graphs Theme 1: Basic Properties of Trees A (rooted) tree is a finite set of nodes such that ¯ there is a specially designated node called the root. ¯ d Ì ;Ì ;::: ;Ì ½ ¾ the remaining nodes are partitioned into disjoint sets d such that each of these Ì ;Ì ;::: ;Ì d ½ ¾ sets is a tree. The sets d are called subtrees,and the degree of the root. The above is an example of a recursive definition, as we have already seen in previous modules. A Ì Ì Ì B C ¾ ¿ Example 1: In Figure 1 we show a tree rooted at with three subtrees ½ , and rooted at , and D , respectively. We now introduce some terminology for trees: ¯ A tree consists of nodes or vertices that store information and often are labeled by a number or a letter. In Figure 1 the nodes are labeled as A;B;:::;Å. ¯ An edge is an unordered pair of nodes (usually denoted as a segment connecting two nodes). A; B µ For example, ´ is an edge in Figure 1. A ¯ The number of subtrees of a node is called its degree. For example, node is of degree three, while node E is of degree two. The maximum degree of all nodes is called the degree of the tree. Ã ; Ä; F ; G; Å ; Á Â ¯ A leaf or a terminal node is a node of degree zero. Nodes and are leaves in Figure 1. B ¯ A node that is not a leaf is called an interior node or an internal node (e.g., see nodes and D ).
    [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]