DOCSLIB.ORG

Defective and Clustered Graph Colouring∗

Total Page：16

File Type：pdf, Size：1020Kb

Download full-text PDF Read full-text
Defective and Clustered Graph Colouring∗ Defective and Clustered Graph Colouring∗ † David R. Wood Abstract. defect d Consider the following two ways to colour the verticesd of a graph whereclustering the crequirement that adjacent vertices get distinct coloursc is relaxed. A colouring has if each monochromatic component has maximum degree at most . A colouring has if each monochromatic component has at most vertices. This paper surveys research on these types of colourings, where the first priority is to minimise the number of colours, with small defect or small clustering as a secondary goal. List colouring variants are also considered. The following graph classes are studied: outerplanar graphs, planar graphs, graphs embeddable in surfaces, graphs with given maximum degree, graphs with given maximum average degree, graphs excluding a given subgraph, graphs with linear crossing number, linklessly or knotlessly embeddable graphs, graphs with given Colin de Verdi`ereparameter,Kt graphs with givenK circumference,s;t graphs excluding a fixed graph as an immersion,H graphs with given thickness, graphs with given stack- or queue-number, graphs excluding as a minor, graphs excluding as a minor, and graphs excluding an arbitrary graph as a minor. Several open problems are discussed. arXiv:1803.07694v1 [math.CO] 20 Mar 2018 ∗ Electronic Journal of Combinatorics c Davidhttp://www.combinatorics.org/DS23 R. Wood. Released under the CC BY license (International 4.0). † This is a preliminary version of a dynamic survey to be published in the [email protected] , #DS23, . School of Mathematical Sciences, Monash University, Melbourne, Australia ( ). Research supported by the Australian Research Council. 1 Contents 1 Introduction3 1.1 History and Terminology . .3 1.2 Definitions . .5 1.3 Choosability . .6 1.4 Standard Examples . .6 1.5 Two Fundamental Observations . .8 2 Greedy Approaches 10 1.6 Related Topics . .9 2.1 Light Edges . 10 3 Graphs on Surfaces 11 2.2 Islands . 10 3.1 Outerplanar Graphs . 11 3.2 Planar Graphs . 11 3.3 Hex Lemma . 13 3.4 Defective Colouring of Graphs on Surfaces . 14 4 Maximum Degree 19 3.5 Clustered Colouring of Graphs on Surfaces . 16 5 Maximum Average Degree 23 6 Excluding a Subgraph 25 7 Excluding a Shallow Minor 26 ∗ Ks;t 7.1 Excluding ...................................... 26 7.2 Linklessly Embeddable Graphs . 28 7.3 Knotlessly Embeddable Graphs . 29 7.4 Colin de Verdi`ereParameter . 30 7.5 Crossings . 31 7.6 Stack and Queue Layouts . 32 8 Minor-Closed Classes 36 7.7 Excluded Immersions . 33 Kt 8.1 ExcludingH a Minor and Bounded Degree . 36 8.2 -Minor-Free Graphs . 38 8.3 -Minor-Free Graphs . 41 8.4 Conjectures . 44 9 Thickness 48 8.5 Circumference . 46 9.1 Defective Colouring . 49 10 General Setting 52 9.2 Clustered Colouring . 51 2 1 Introduction monochromatic component ConsiderG a graphk where each vertexclustering is assignedc a colour. A k is a connected component of the subgraph induced by all thec vertices assignedG a singlek colour. A graphdefectisd -colourable withG if each vertexk can be assigned one of colours such that each monochromaticd component has at most vertices. A graph is -colourable with if each vertex ofd can be assigned one of colours such that each vertex is adjacent to at most neighbours of the same colour; that is, each monochromatic component has maximum degree at most . This paper surveys results and open problems regarding clustered and defective graph colouring, where the first priority is to minimise the number of colours, with small defect or small clustering as a secondary goal. We include various proofs that highlight the main methods employed. The emphasisclustered is on chromatic generalresults number for broadly defined classes of graphs,χ?( ) rather than more precisek G G results for more specific classes.c With this viewpoint the followingk definitions naturally arise. G c k unbounded The of a graphG class , denoted by , is the minimum integer defectively k d for whichG there exists an integer such that every graph in has a -colouring with clusteringG k d defective chromatic number χ∆( ) . If there is no such integer , then has clusteredG chromatic number.G A graph k k k class is -colourableG if there exists an integer such that every graph in is unbounded c G-colourable with defect . The of , denoted by , is the c 1 χ∆( ) χ?( ) χ( ) minimum integer− such thatG 6is defectivelyG 6 G -colourable. If thereG is no such integer , then has defective chromatic number. Every colouring of a graph with clustering has defect . Thus for every class . Tables1 and2 summarise 1.1the results History presented and Terminology in this survey; see Sections 1.2 and 1.3 for the relevant definitions. There is no single origin for the notions of defective and clustered graph colouring, and the terminology used in the literature is inconsistent.k d (k; d)- Earlycolourable papers on defective colouring include [16, 17, 128, 138, 166, 212], although these did notd-relaxed use the termd-improper ‘defect’. The definition of “ -colourable with defect ”, often written G, was introducedd by Cowen et al. [d66-improper]. This terminology chromatic number is fairly standard,d-chromatic although number or G is sometimes used. The minimumdefective number chromatic of colours number in a colouring of a graph with defect has been called the [144] or [16] of . Cowen et al. [65] introduced the of a graph class (as defined above). (k; c)-fragmented Alsok for clustered colouring, thec literature is inconsistent. Onec of the early papers is by Kleinberg et al. [151], who defined a colouring to be if, in our language, it is a -colouring with clusteringchromon. I prefer “clustering” since as increases, intuitively the “fragmentation”metachromatic of the number monochromatic components decreases. Edwards and Farr [89, 90] called a monochromatic component a and called the clustered chromatic number of a class the . 3 ` χ∆( ) χ ( ) G G ∆ G Table 1: Summary of Results for Defective Colouring O graph class Sect. P outerplanar 6 g g 2 2 3.1 E m m m m + 1 + 1 planar 6 A b 2 c3b 2 c 3 3.2 4 4 Euler genus L 3 3 3.4 5 5 max average degree K 5 k k k k linklessly embeddable6 V 7.2 k k k + 1 k + 1 knotlessly embeddable S 7.3 k k k + 1;:::; 2k + 1 2k + 1 Colin de Verdi`ere Q 7.4 Kt t 2 t 1 -stack graphs I − 7.6 -queue graphs6 k k + 1 k + 1 7.6 no immersion6 k 6 ∆ 2 2 7.7 treewidthKt Kt t 1 t 1 8.1 M − td(H)+1 − treewidthH , max degree H td(H) 1;:::; 2 4 min s : t H Ks;t 8.1 M − − f 9 g no Ks;t-minor (s 6 t Ks;t s s 8.2 M k+1 no -minor 6 k k log2 k + 1;:::; 3 log2 k 2 8.3 C b c b c d k+1 e no (k +-minor 1) ) k log2(k + 2) 1;:::; 3 log2 k 2 8.4 Hg d e − b c b c circumferenceg k 2k + 1 2k + 1 8.5 6 Tk no -path 8.5 -thickness 9 ` χ?( ) χ ( ) G G ? G Table 2: SummaryO of Results for Clustered Colouring graph class Sect. P g g outerplanar 6 E 3 3 3.1 planar 6 g 6 ∆ 43 3 4; 4 3.2 ∆+6 ∆+1 ∆+6 Euler genus6 ∆ ∆ 4 ;:::;43 4 ;:::; 4 ∆ + 1 3.5 D m m Euler genus , max degreem m + 1;:::; m + 1 + 1;:::; m + 1 8.1 6 A b 2 c b c b 2 c b c 5 5 max degree L 4 6 6 max average degree K 5 k k linklessly embeddable6 V 7.2 k k k + 2;:::; 2k + 2 k + 2 ::: 2k + 2 knotlessly embeddable S 7.3 Colink de Verdi`ere k k +open 1;:::; 4k k + open1;:::; 4k 7.4 Q t+4 Kt t t 1 -stack graphs I > b 4 c > − 7.6 -queue graphs6 k k + 1 k + 1 7.6 no immersion6 k 6 ∆ 2 2 7.7 31 Kt K t 1;:::; 2t 2 t 1;:::; t treewidth M t − − − d 2 e 8.1 treewidthKt , max degree6 ∆ 3 > 3 8.1 td(H)+1 no H -minor H td(H) 1;:::; 2 4 8.2 M − − no Ks;t-minor, max(s degreet K s + 1;:::; 2s + 2 8.2 6 M s;t k k log k + 1;:::; 3 log k no -minor 6 C b 2 c b 2 c open 8.3 no (k +-minor 1) ) k log2(k + 2) 1;:::; 3 log2 k open 8.4 Hg d e − b c g k 2k + 2;:::; 6k + 1 2k + 2;:::; 6k + 1 circumference6 Tk open 8.5 no -path open 8.5 -thickness 9 4 1.2 Definitions clique This section briefly states standard graph theoretic definitions, familiar to most readers. G k-colouring G k A G in a graphvw isG a setbichromatic of pairwise adjacentv w vertices. v LetG properlybe a graph. A v of is a function that assigns one of coloursv to each vertex of G. Anproper edge of is if and are assignedchromatic distinct number colours.G A vertexχ(Gof) is coloured ifk is assigned a colour distinctk from every neighbourG of . A colouring of graphis parameterif every vertex is properly coloured.f The of ,f denoted(G1) = f(G2), is the minimum integerG1 suchG2 that there is a properf -colouringbounded of . G c f(G) c G f unbounded f A is a real-valued6 function2 G on the class of graphs such thatG f( ) := sup f(G): G wheneverG graphsG and f are isomorphic.2 Gg Say is on a graph class if there f f( ) = max f(G): G exists such that for every , otherwiseG is G onf .
Load more

Recommended publications
  • Intrinsic Linking and Knotting of Graphs in Arbitrary 3–Manifolds 1 Introduction
    Algebraic & Geometric Topology 6 (2006) 1025–1035 1025 arXiv version: fonts, pagination and layout may vary from AGT published version Intrinsic linking and knotting of graphs in arbitrary 3–manifolds ERICA FLAPAN HUGH HOWARDS DON LAWRENCE BLAKE MELLOR We prove that a graph is intrinsically linked in an arbitrary 3–manifold M if and only if it is intrinsically linked in S3 . Also, assuming the Poincare´ Conjecture, we prove that a graph is intrinsically knotted in M if and only if it is intrinsically knotted in S3 . 05C10, 57M25 1 Introduction The study of intrinsic linking and knotting began in 1983 when Conway and Gordon [1] 3 showed that every embedding of K6 (the complete graph on six vertices) in S contains 3 a non-trivial link, and every embedding of K7 in S contains a non-trivial knot. Since the existence of such a non-trivial link or knot depends only on the graph and not on the 3 particular embedding of the graph in S , we say that K6 is intrinsically linked and K7 is intrinsically knotted. At roughly the same time as Conway and Gordon’s result, Sachs [12, 11] independently proved that K6 and K3;3;1 are intrinsically linked, and used these two results to prove that any graph with a minor in the Petersen family (Figure 1) is intrinsically linked. Conversely, Sachs conjectured that any graph which is intrinsically linked contains a minor in the Petersen family. In 1995, Robertson, Seymour and Thomas [10] proved Sachs’ conjecture, and thus completely classified intrinsically linked graphs.
    [Show full text]
  • On a Conjecture Concerning the Petersen Graph
    On a conjecture concerning the Petersen graph Donald Nelson Michael D. Plummer Department of Mathematical Sciences Department of Mathematics Middle Tennessee State University Vanderbilt University Murfreesboro,TN37132,USA Nashville,TN37240,USA [email protected] [email protected] Neil Robertson* Xiaoya Zha† Department of Mathematics Department of Mathematical Sciences Ohio State University Middle Tennessee State University Columbus,OH43210,USA Murfreesboro,TN37132,USA [email protected] [email protected] Submitted: Oct 4, 2010; Accepted: Jan 10, 2011; Published: Jan 19, 2011 Mathematics Subject Classifications: 05C38, 05C40, 05C75 Abstract Robertson has conjectured that the only 3-connected, internally 4-con- nected graph of girth 5 in which every odd cycle of length greater than 5 has a chord is the Petersen graph. We prove this conjecture in the special case where the graphs involved are also cubic. Moreover, this proof does not require the internal-4-connectivity assumption. An example is then presented to show that the assumption of internal 4-connectivity cannot be dropped as an hypothesis in the original conjecture. We then summarize our results aimed toward the solution of the conjec- ture in its original form. In particular, let G be any 3-connected internally-4- connected graph of girth 5 in which every odd cycle of length greater than 5 has a chord. If C is any girth cycle in G then N(C)\V (C) cannot be edgeless, and if N(C)\V (C) contains a path of length at least 2, then the conjecture is true. Consequently, if the conjecture is false and H is a counterexample, then for any girth cycle C in H, N(C)\V (C) induces a nontrivial matching M together with an independent set of vertices.
    [Show full text]
  • Knots, Links, Spatial Graphs, and Algebraic Invariants
    689 Knots, Links, Spatial Graphs, and Algebraic Invariants AMS Special Session on Algebraic and Combinatorial Structures in Knot Theory AMS Special Session on Spatial Graphs October 24–25, 2015 California State University, Fullerton, CA Erica Flapan Allison Henrich Aaron Kaestner Sam Nelson Editors American Mathematical Society 689 Knots, Links, Spatial Graphs, and Algebraic Invariants AMS Special Session on Algebraic and Combinatorial Structures in Knot Theory AMS Special Session on Spatial Graphs October 24–25, 2015 California State University, Fullerton, CA Erica Flapan Allison Henrich Aaron Kaestner Sam Nelson Editors American Mathematical Society Providence, Rhode Island EDITORIAL COMMITTEE Dennis DeTurck, Managing Editor Michael Loss Kailash Misra Catherine Yan 2010 Mathematics Subject Classification. Primary 05C10, 57M15, 57M25, 57M27. Library of Congress Cataloging-in-Publication Data Names: Flapan, Erica, 1956- editor. Title: Knots, links, spatial graphs, and algebraic invariants : AMS special session on algebraic and combinatorial structures in knot theory, October 24-25, 2015, California State University, Fullerton, CA : AMS special session on spatial graphs, October 24-25, 2015, California State University, Fullerton, CA / Erica Flapan [and three others], editors. Description: Providence, Rhode Island : American Mathematical Society, [2017] | Series: Con- temporary mathematics ; volume 689 | Includes bibliographical references. Identifiers: LCCN 2016042011 | ISBN 9781470428471 (alk. paper) Subjects: LCSH: Knot theory–Congresses. | Link theory–Congresses. | Graph theory–Congresses. | Invariants–Congresses. | AMS: Combinatorics – Graph theory – Planar graphs; geometric and topological aspects of graph theory. msc | Manifolds and cell complexes – Low-dimensional topology – Relations with graph theory. msc | Manifolds and cell complexes – Low-dimensional topology – Knots and links in S3.msc| Manifolds and cell complexes – Low-dimensional topology – Invariants of knots and 3-manifolds.
    [Show full text]
  • The 4-Girth-Thickness of the Complete Graph
    Also available at http://amc-journal.eu ISSN 1855-3966 (printed edn.), ISSN 1855-3974 (electronic edn.) ARS MATHEMATICA CONTEMPORANEA 14 (2018) 319–327 The 4-girth-thickness of the complete graph Christian Rubio-Montiel UMI LAFMIA 3175 CNRS at CINVESTAV-IPN, 07300, Mexico City, Mexico Division´ de Matematicas´ e Ingenier´ıa, FES Ac-UNAM, 53150, Naulcalpan, Mexico Received 10 March 2017, accepted 21 June 2017, published online 19 September 2017 Abstract In this paper, we define the 4-girth-thickness θ(4;G) of a graph G as the minimum number of planar subgraphs of girth at least 4 whose union is G. We prove that the 4- girth-thickness of an arbitrary complete graph K , θ(4;K ), is n+2 for n = 6; 10 and n n 4 6 θ(4;K6) = 3. Keywords: Thickness, planar decomposition, girth, complete graph. Math. Subj. Class.: 05C10 1 Introduction A finite graph G is planar if it can be embedded in the plane without any two of its edges g crossing. A planar graph of order n and girth g has size at most g 2 (n 2) (see [6]), and an acyclic graph of order n has size at most n 1, in this case,− we define− its girth as . The thickness θ(G) of a graph G is the minimum− number of planar subgraphs whose union1 is G; i.e. the minimum number of planar subgraphs into which the edges of G can be partitioned. The thickness was introduced by Tutte [11] in 1963. Since then, exact results have been obtained when G is a complete graph [1,3,4], a complete multipartite graph [5, 12, 13] or a hypercube [9].
    [Show full text]
  • Simple Treewidth Kolja Knauer 1 1 Introduction
    Simple Treewidth Kolja Knauer 1 Technical University Berlin [email protected] Joint work with Torsten Ueckerdt 2. 1 Introduction A k-tree is a graph that can be constructed starting with a (k+1)-clique and in every step attaching a new vertex to a k-clique of the already constructed graph. The treewidth tw(G) of a graph G is the minimum k such that G is a partial k-tree, i.e., G is a subgraph of some k-tree [7]. We consider a variation of treewidth, called simple treewidth. A simple k-tree is a k-tree with the extra requirement that there is a construction sequence in which no two vertices are attached to the same k-clique. (Equiv- alently, a k-tree is simple if it has a tree representation of width k in which every (k − 1)-set of subtrees intersects at most 2 tree-vertices.) Now, the simple treewidth stw(G) of G is the minimum k such that G is a partial simple k-tree, i.e., G is a subgraph of some simple k-tree. We have encountered simple treewidth as a natural parameter in ques- tions concerning geometric representations of graphs, i.e., representing graphs as intersection graphs of geometrical objects where the quality of the repre- sentation is measured by the complexity of the objects. E.g., we have shown that the maximal interval-number([3]) of the class of treewidth k graphs is k + 1, whereas for the class of simple treewidth k graphs it is k, see [6].
    [Show full text]
  • When Graph Theory Meets Knot Theory
    Contemporary Mathematics When graph theory meets knot theory Joel S. Foisy and Lewis D. Ludwig Abstract. Since the early 1980s, graph theory has been a favorite topic for undergraduate research due to its accessibility and breadth of applications. By the early 1990s, knot theory was recognized as another such area of mathe- matics, in large part due to C. Adams' text, The Knot Book. In this paper, we discuss the intersection of these two fields and provide a survey of current work in this area, much of which involved undergraduates. We will present several new directions one could consider for undergraduate work or one's own work. 1. Introduction This survey considers three current areas of study that combine the fields of graph theory and knot theory. Recall that a graph consists of a set of vertices and a set of edges that connect them. A spatial embedding of a graph is, informally, a way to place the graph in space. Historically, mathematicians have studied various graph embedding problems, such as classifying what graphs can be embedded in the plane (which is nicely stated in Kuratowski's Theorem [25]), and for non-planar graphs, what is the fewest number of crossings in a planar drawing (which is a difficult question for general graphs and still the subject of ongoing research, see [23] for example). A fairly recent development has been the investigation of graphs that have non-trivial links and knots in every spatial embedding. We say that a graph is intrinsically linked if it contains a pair of cycles that form a non-splittable link in every spatial embedding.
    [Show full text]
  • On Intrinsically Knotted and Linked Graphs
    A BRIEF SURVEY ON INTRINSICALLY KNOTTED AND LINKED GRAPHS RAMIN NAIMI 1. Introduction In the early 1980's, Sachs [36, 37] showed that if G is one of the seven graphs in Figure 1, known as the Petersen family graphs, then every spatial embedding of G, i.e. embedding of G in S3 or R3, contains a nontrivial link | specifically, two cycles that have odd linking number. Henceforth, spatial embedding will be shortened to embedding; and we will not distinguish between an embedding and its image. A graph is intrinsically linked (IL) if every embedding of it contains a nontrivial link. For example, Figure 1 shows a specific embedding of the first graph in the Petersen family, K6, the complete graph on six vertices, with a nontrivial 2-component link highlighted. At about the same time, Conway and Gordon [4] also showed that K6 is IL. They further showed that K7 in intrinsically knotted (IK), i.e. every spatial embedding of it contains a nontrivial knot. Figure 1. Left: The Petersen family graphs [42]. Right: An embedding of K6, with a nontrivial link highlighted. A graph H is a minor of another graph G if H can be obtained from a subgraph arXiv:2006.07342v1 [math.GT] 12 Jun 2020 of G by contracting zero or more edges. It's not difficult to see that if G has a linkless (resp. knotless) embedding, i.e., G is not IL (IK), then every minor of G has a linkless (knotless) embedding [6, 30]. So we say the property of having a linkless (knotless) embedding is minor closed (also called hereditary).
    [Show full text]
  • Computing Linkless and Flat Embeddings of Graphs in R3
    Computing Linkless and Flat Embeddings of Graphs in R3 Stephan Kreutzer Technical University Berlin based on joint work with Ken-ichi Kawarabayashi, Bojan Mohar and Bruce Reed Graph Theory @ Georgie Tech Symposium in Honour of Robin Thomas 7 - 11 May 2012 Drawing Graphs Nicely Graph drawing. The motivation for this work comes from graph drawing: we would like to draw a graph in a way that it is nicely represented. Drawing in two dimensions. Usually we draw graphs on the plane or other surfaces. Planar graphs. Draw a graph on the plane such that no edges cross. Plane embeddings of planar graphs can be computed in linear time. STEPHAN KREUTZER COMPUTING LINKLESS AND FLAT EMBEDDINGS IN R3 2/21 Kuratowski Graphs Of course not every graph is planar. The graphs K3,3 and K5 are examples of non-planar graphs. Theorem. (Kuratowski) Every non-planar graph contains a sub-division of K5 or K3,3 as sub-graph. Definition. • Kuratowski graph: subdivision of K5 or K3,3. • H Kuratowski-subgraph of G if H ⊆ G is isomorphic to a subdivision of K3,3 or K5 STEPHAN KREUTZER COMPUTING LINKLESS AND FLAT EMBEDDINGS IN R3 3/21 Drawings in R3 Non-planar graphs. One option is to draw them on surfaces of higher genus. Again such embeddings (if exist) can be computed in linear time (Mohar) Drawings in R3. We are interested in drawing graphs nicely in R3. Clearly, every graph can be drawn in R3 without crossing edges. To define nice drawings one wants to generalise the property of planar graphs that disjoint cycles are not intertwined, i.e.
    [Show full text]
  • [Cs.CG] 9 Sep 2002 ⋆⋆ Uhpors a Enmd;Se[,3 O Noeve.O H Ot P Imple More the Heuristic Effectiveness
    On Simultaneous Graph Embedding C. A. Duncan1, A. Efrat∗2, C. Erten∗2, S. G. Kobourov⋆2, and J. S. B. Mitchell⋆⋆3 1 Dept. of Computer Science, Univ. of Miami, [email protected] 2 Dept. of Computer Science, Univ. of Arizona, {alon,erten,kobourov}@cs.arizona.edu 3 Dept. of Applied Mathematics and Statistics, Stony Brook University, [email protected] Abstract. We consider the problem of simultaneous embedding of pla- nar graphs. There are two variants of this problem, one in which the mapping between the vertices of the two graphs is given and another where the mapping is not given. In particular, we show that without mapping, any number of outerplanar graphs can be embedded simulta- neously on an O(n) × O(n) grid, and an outerplanar and general planar graph can be embedded simultaneously on an O(n2) × O(n3) grid. If the mapping is given, we show how to embed two paths on an n × n grid, or two caterpillar graphs on an O(n2) × O(n3) grid. 1 Introduction The areas of graph drawing and information visualization have seen significant growth in recent years. Often the visualization problems involve taking infor- mation in the form of graphs and displaying them in a manner that both is aesthetically pleasing and conveys some meaning. The aesthetic criteria by itself are the topic of much debate and research, but some generally accepted and tested standards include preferences for straight-line edges or those with only a few bends, a limited number of crossings, good separation of vertices and edges, as well as a small overall area.
    [Show full text]
  • The Book Thickness of a Graph There Are Several Geometric
    View metadata, citation and similar papers at core.ac.uk brought to you by CORE provided by Elsevier - Publisher Connector JOURNAL OF COMBINATORIAL THEORY, Series B 27, 320-331 (1979) The Book Thickness of a Graph FRANK BERNHART* Department of Combinatorics and Optimization, Faculty of Mathematics, University of Waterloo, Waterloo, Ontario, Canada AND PAUL C. KAINEN+ Department of Mathematics and Statistics, Case Western Reserve University, Cleveland, Ohio Communicated by the Editors Received July 19, 1975 The book thickness bt(G) of a graph G is defined, its basic properties are delineated, and relations are given with other invariants such as thickness, genus, and chromatic number. A graph G has book thickness bt(G) < 2 if and only if it is a subgraph of a hamiltonian planar graph, but we conjecture that there are planar graphs with arbitrarily high book thickness. 1. INTRODUCTION There are several geometric invariants which have been studied extensively for graphs-among them, genus and thickness. In this paper we introduce a new invariant defined by considering embeddings of graphs into the members of what seems to us to be a very natural class of objects. For n >, 0, an n-book, or a book with n pages, consists of a line L in 3- space (called the spine) together with n distinct half-planes (called pages) with L as their common boundary. We usually adopt the convention that L is the z axis (in the standard parameterization of euclidean 3-space) and so is oriented “up” and “down.” An n-book embedding is a topological embedding /3 of G in an n-book which carries each vertex into the spine and each edge into the interior of at most one page.
    [Show full text]
  • Graph Treewidth and Geometric Thickness Parameters
    Graph Treewidth and Geometric Thickness Parameters Vida Dujmovi´c 1? and David R. Wood 2?? 1 School of Computer Science, Carleton University, Ottawa, Canada ([email protected]) 2 Departament de Matem`atica Aplicada II, Universitat Polit`ecnicade Catalunya, Barcelona, Spain ([email protected]) Abstract. Consider a drawing of a graph G in the plane such that cross- ing edges are coloured differently. The minimum number of colours, taken over all drawings of G, is the classical graph parameter thickness θ(G). By restricting the edges to be straight, we obtain the geometric thick- ness θ(G). By further restricting the vertices to be in convex position, we obtain the book thickness bt(G). This paper studies the relationship between these parameters and the treewidth of G. Let θ(Tk)/ θ(Tk) / bt(Tk) denote the maximum thickness / geometric thickness / book thickness of a graph with treewidth at most k. We prove that: – θ(Tk) = θ(Tk) = dk/2e, and – bt(Tk) = k for k ≤ 2, and bt(Tk) = k + 1 for k ≥ 3. The first result says that the lower bound for thickness can be matched by an upper bound, even in the more restrictive geometric setting. The second result disproves the conjecture of Ganley and Heath [Discrete Appl. Math. 2001] that bt(Tk) = k for all k. Analogous results are proved for outerthickness, arboricity, and star-arboricity. 1 Introduction Partitions of the edge set of a graph G into a small number of ‘nice’ subgraphs is in the mainstream of graph theory. For example, in a proper edge colouring, the subgraphs of the partition are matchings.
    [Show full text]
  • Planar Graphs, Biplanar Graphs and Graph Thickness
    California State University, San Bernardino CSUSB ScholarWorks Electronic Theses, Projects, and Dissertations Office of aduateGr Studies 12-2016 PLANAR GRAPHS, BIPLANAR GRAPHS AND GRAPH THICKNESS Sean M. Hearon California State University - San Bernardino Follow this and additional works at: https://scholarworks.lib.csusb.edu/etd Part of the Discrete Mathematics and Combinatorics Commons Recommended Citation Hearon, Sean M., "PLANAR GRAPHS, BIPLANAR GRAPHS AND GRAPH THICKNESS" (2016). Electronic Theses, Projects, and Dissertations. 427. https://scholarworks.lib.csusb.edu/etd/427 This Thesis is brought to you for free and open access by the Office of aduateGr Studies at CSUSB ScholarWorks. It has been accepted for inclusion in Electronic Theses, Projects, and Dissertations by an authorized administrator of CSUSB ScholarWorks. For more information, please contact [email protected]. Planar Graphs, Biplanar Graphs and Graph Thickness A Thesis Presented to the Faculty of California State University, San Bernardino In Partial Fulfillment of the Requirements for the Degree Master of Arts in Mathematics by Sean Michael Hearon December 2016 Planar Graphs, Biplanar Graphs and Graph Thickness A Thesis Presented to the Faculty of California State University, San Bernardino by Sean Michael Hearon December 2016 Approved by: Dr. Jeremy Aikin, Committee Chair Date Dr. Cory Johnson, Committee Member Dr. Rolland Trapp, Committee Member Dr. Charles Stanton, Chair, Dr. Cory Dunn Department of Mathematics Graduate Coordinator, Department of Mathematics iii Abstract A graph is planar if it can be drawn on a piece of paper such that no two edges cross. The smallest complete and complete bipartite graphs that are not planar are K5 and K3;3.
    [Show full text]