DOCSLIB.ORG

Digraph Coloring Games and Game-Perfectness

Total Page：16

File Type：pdf, Size：1020Kb

Download full-text PDF Read full-text
Digraph Coloring Games and Game-Perfectness Digraph Coloring Games and Game-Perfectness Inaugural–Dissertation zur Erlangung des Doktorgrades der Mathematisch-Naturwissenschaftlichen Fakult¨at der Universit¨at zu K¨oln vorgelegt von Stephan Dominique Andres aus Geldern Verlag Dr. Hut, M¨unchen 2007 Berichterstatter: Prof. Dr. Ulrich Faigle Prof. Dr. Rainer Schrader Tag der m¨undlichen Pr¨ufung: 30.11.2007 Kurzzusammenfassung In dieser Arbeit wird die spielchromatische Zahl eines Digraphen als spiel- theoretische Variante der dichromatischen Zahl eingef¨uhrt. Dieser Begriff verallgemeinert die bekannte spielchromatische Zahl eines Graphen. Ein er- weitertes Modell ber¨ucksichtigt ebenfalls relaxierte F¨arbungen sowie asym- metrische Zugfolgen. Spielperfektheit wird als spieltheoretische Variante der Perfektheit eines Graphen definiert und auf Digraphen verallgemeinert. Obere und untere Schranken f¨ur die spielchromatische Zahl verschiedener Klassen von Digraphen werden untersucht. Im letzten Teil der Arbeit wer- den spielperfekte Digraphen mit kleiner Cliquenzahl charakterisiert, sowie all- gemeine Resultate ¨uber Spielperfektheit gezeigt. Einige Resultate wurden mit Hilfe eines Computerprogramms verifiziert, welches im Anhang diskutiert wird. Abstract In this thesis the game chromatic number of a digraph is introduced as a game-theoretic variant of the dichromatic number. This notion generalizes the well-known game chromatic number of a graph. An extended model also takes into account relaxed colorings and asymmetric move sequences. Game- perfectness is defined as a game-theoretic variant of perfectness of a graph, and is generalized to digraphs. We examine upper and lower bounds for the game chromatic number of several classes of digraphs. In the last part of the thesis, we characterize game-perfect digraphs with small clique number, and prove general results concerning game-perfectness. Some results are verified with the help of a computer program that is discussed in the appendix. Contents List of figures iii List of tables v About this thesis vii Acknowledgements ix 1 Introduction 1 1.1 Digraphs.............................. 2 1.2 Classesofgraphs ......................... 4 1.3 Surfaces .............................. 6 1.4 The dichromatic number of a digraph . 7 1.5 Adigraphcoloringgame . .. 8 1.6 Adigraphmarkinggame. 11 1.7 Examples ............................. 12 1.8 Previousresults .......................... 14 2 Forests 19 2.1 Coloringgamesondirectedforests. 19 2.2 Undirectedforests. .. .. 29 2.3 Forest-likestructures . 34 2.4 Orientationsofplanargraphs . 39 2.5 Openproblems .......................... 40 3 Lightness of digraphs in surfaces 43 3.1 Lightnessandweight . .. .. 43 3.2 The parameter M(S)....................... 46 3.3 Thestructureofdigraphsinsurfaces . 48 3.4 Thestructureofgraphsinsurfaces . 52 3.5 Applicationrange......................... 55 3.6 Tightnessofthebounds . 56 3.7 Application to coloring and marking games . 60 3.8 Anotherapplicationidea . 64 i ii CONTENTS 4 The incidence game chromatic number 67 4.1 k-degenerategraphs. 69 4.2 Somesimpleclassesofgraphs . 73 5 Game-perfect graphs 79 5.1 Perfectness and game-perfectness . 79 5.2 B-perfect graphs with clique number 2 . 82 5.3 A-perfect graphs with clique number 2 . 83 5.4 Bodlaender’soriginalversion. 87 5.5 Thegeneralcase ......................... 89 5.6 TowardsaStrongPerfectGraphTheorem . 91 5.7 B-perfectdigraphs ........................ 95 5.8 A-perfectdigraphs ........................ 95 5.8.1 Semiorientations of complete graphs . 96 5.8.2 Paths ........................... 97 5.8.3 Cycles ........................... 101 Appendix 105 A Complexity results 107 B Game-tree search 113 B.1 Theprogram ........................... 114 B.2 Runningtimeoftheprogram . 123 B.3 Computationalresults . 125 B.4 Acceleratingthealgorithm . 129 C Minor open questions 137 D Major open questions 139 Bibliography 141 Index 147 List of Figures 1.1 A graph, a simple digraph, and none of them . 3 1.2 Two ways of depicting a digraph . 3 1.3 AHalingraph........................... 5 1.4 The transitive tournament T4 .................. 13 2.1 Thepigeon-holeprinciple. 25 2.2 Possible configuration for w ................... 26 2.3 ThedigraphofLemma13 . .. 26 2.4 ThedigraphofProposition14 . 27 2.5 Vertex vik is added to the set of origin vertices . 30 2.6 Thefivecases ........................... 33 2.7 Adirected3-cycledforest . 35 2.8 Structure of the induced subtree of a T -component . 35 2.9 First case of splitting a T -component .............. 36 2.10 Second case of splitting a T -component. 36 2.11 Third case of splitting a T -component ............. 37 2.12 The main parts of the left half of D1 .............. 37 2.13 ThedigraphofTheorem23 . 41 3.1 A non-regular graph for which (3.1) is trivial . 44 3.2 The tree T(1,1)............................ 45 3.3 Subdividingthe‘fat’arcs. 49 3.4 Projective twisted dodekahedron . 58 3.5 Graphwithtorusidentification . 58 3.6 Digraph with Klein bottle identification . 58 3.7 Double-twisted double-clock . 59 3.8 Digraphwith63verticesand105arcs. 60 3.9 ThedigraphofTheorem43 . 63 4.1 Pairs of adjacent and non-adjacent incidences . 67 4.2 Arcs adjacent to (v,w) which may be activated . 70 4.3 The incidences adjacent to the incidence (v,vw)........ 71 4.4 A winning configuration for Bob on a cycle . 73 iii iv LIST OF FIGURES 4.5 StateofthegameafterBob’ssecondmove . 74 5.1 Two forbidden configurations for B-perfectgraphs . 81 5.2 Twographswithdiameter3 . 83 5.3 Two forbidden configurations for A-perfectgraphs . 85 5.4 The graph G2 ........................... 90 5.5 An interval graph which is not B-perfect ............ 90 5.6 An interval graph which is not A-perfect ............ 91 5.7 A broken wheel with clique number 3 . 92 5.8 Two more forbidden configurations for B-perfect graphs. 93 5.9 Two B-perfect graphs with clique number 4 . 94 5.10 g-perfect graphs the complements of which are not g-perfect . 95 5.11 Semiorientations of K3 ...................... 96 0 5.12 C~4 ................................. 97 5.13 The forbidden configuration F3,1 ................. 98 5.14 The forbidden configuration F3,2 ................. 98 5.15 The forbidden configuration F4 ................. 98 5.16 The forbidden configuration F5,1 ................. 98 5.17 The forbidden configuration F5,2 ................. 98 5.18 The forbidden configuration F7,1 ................. 98 5.19 The forbidden configuration F7,2 ................. 98 5.20 The forbidden configuration F8 ................. 98 5.21 The 47 A-perfectpaths...................... 99 5.22 8forbiddencycles. 100 5.23 The 14 A-perfect semiorientations of cycles . 101 A.1 Digraph for the formula f(x)................... 108 A.2 Simple digraph replacing an edge . 110 A.3 The configurations AT (n) and AL(n).............. 111 B.1 Thecube.............................. 127 B.2 Semiorientations of the Petersen graph . 128 List of Tables 3.1 Bounds for M (nonorientablecase) . 47 3.2 Bounds for M (orientablecase) . 48 3.3 Upper bounds for the lightness of certain graphs embeddable inanorientablesurface. 56 3.4 Upper bounds for the lightness of certain graphs embeddable inanonorientablesurface . 57 3.5 Upper bounds for the game coloring number of certain graphs embeddable in an orientable surface . 64 3.6 Upper bounds for the game coloring number of certain graphs embeddable in a nonorientable surface . 65 B.1 Running time versus density (2 colors, game gA)........ 125 B.2 Running time versus density (2 colors, game A) ........ 126 B.3 Running time versus density (3 colors, game gA)........ 126 B.4 Running time in a sparse case with the maximal number of colors127 B.5 Running time in the densest case with the maximal number of colors................................ 127 B.6 Computer results and CPU time for various instances . 129 B.7 Running time versus density (2 colors, game gA, improved al- gorithm).............................. 131 B.8 Running time versus density (2 colors, game A, improved algo- rithm) ............................... 131 B.9 Running time in a sparse case with the maximal number of colors(improvedalgorithm). 132 B.10 Running time of the improved algorithm on complete graphs . 133 B.11 Running time of the improved algorithm on semi-dense graphs 133 B.12 Results for the line graph of the Petersen graph (game gA with precoloring) ............................ 134 B.13 Results for the line graph of the Petersen graph (game gB with precoloring) ............................ 135 v vi LIST OF TABLES About this thesis In this thesis the game chromatic number of a digraph is introduced and ex- amined. This parameter is defined by the following non-cooperative 2-person game g. We are given a finite digraph D =(V, E), a finite color set C and two players, Alice and Bob. The players alternately color a vertex v of D with a color c of C which is selected in such a way that no in-neighbor of v is already colored with c. When no such move is possible any more, the game ends. If every vertex is colored at the end of the game, Alice wins, otherwise Bob. The game chromatic number of D is the smallest cardinality of a color set C for which Alice has a winning strategy for the game played with D and C. In this thesis graphs are always considered as digraphs with pairs of oppositely directed arcs. Then the game chromatic number of a digraph generalizes the well-known game chromatic number of a graph. After an introduction into the notions, a motivation, and a historical re- view in Chapter 1, we examine a generalization of the game on undirected and directed forests in Chapter 2. This generalization
Load more

Recommended publications
  • Between Proper and Strong Edge-Colorings of Subcubic Graphs
    Between proper and strong edge-colorings of subcubic graphs Herve Hocquard1, Dimitri Lajou2, and Borut Luˇzar3 1 Univ. Bordeaux, CNRS, Bordeaux INP, LaBRI, UMR 5800, F-33400, Talence, France [email protected] 2 Univ. Bordeaux, CNRS, Bordeaux INP, LaBRI, UMR 5800, F-33400, Talence, France [email protected] 3 Faculty of Information Studies, Novo mesto, Slovenia [email protected] Abstract. In a proper edge-coloring the edges of every color form a matching. A matching is induced if the end-vertices of its edges induce a matching. A strong edge-coloring is an edge-coloring in which the edges of every color form an induced matching. We consider intermediate types of edge-colorings, where some of the colors are allowed to form match- ings, and the remaining form induced matchings. Our research is moti- vated by the conjecture proposed in a recent paper on S-packing edge- colorings (N. Gastineau and O. Togni, On S-packing edge-colorings of cubic graphs, Discrete Appl. Math. 259 (2019)). We prove that every graph with maximum degree 3 can be decomposed into one matching and at most 8 induced matchings, and two matchings and at most 5 induced matchings. We also show that if a graph is in class I, the num- ber of induced matchings can be decreased by one, hence confirming the conjecture for this class of graphs. Keywords: Strong edge-coloring · S-packing edge-coloring · Induced matching 1 Introduction A proper edge-coloring of a graph G = (V; E) is an assignment of colors to the edges of G such that adjacent edges are colored with distinct colors.
    [Show full text]
  • Arxiv:2006.03188V2 [Math.CO] 13 Jun 2020 Eerhcuclo Aaa(NSERC)
    A NOTE ON THE CONNECTED GAME COLORING NUMBER PETER BRADSHAW Abstract. We consider the connected game coloring number of a graph, introduced by Charpentier et al. as a game theoretic graph parameter that measures the degeneracy of a graph with respect to a connected version of the graph marking game. We establish bounds for the connected game coloring number of graphs of bounded treedepth and of k-trees. We also show that there exists an outerplanar 2-tree with connected game coloring number 5, which answers a question from [C. Charpentier, H. Hocquard, E. Sopena, and X. Zhu. A connected version of the graph coloring game. Discrete Appl. Math., 2020]. 1. Introduction Let G be a finite graph. The coloring game on G, introduced by Bodlaender [1], is defined as follows. Two players, Alice and Bob, take turns coloring vertices of G using colors from a set of k colors. On each player’s move, the player chooses an uncolored vertex from V (G) and colors this vertex with one of the k given colors. Alice moves first, and on each turn, both players are forbidden from coloring a vertex v with a color already used at a neighbor of v; that is, both players must color G properly. The game continues until all of G is colored or there is no legal move. Alice’s goal is to complete a proper coloring on G, and Bob’s goal is to reach a game state in which G has at least one uncolored vertex but no move is legal. The game chromatic number of G, written χg(G), is defined as the minimum integer k for which Alice has a winning strategy in the coloring game played with k colors.
    [Show full text]
  • Deciding the On-Line Chromatic Number of a Graph with Pre-Coloring Is PSPACE-Complete
    Deciding the On-line Chromatic Number of a Graph with Pre-Coloring is PSPACE-Complete Christian Kudahl University of Southern Denmark [email protected] July 7, 2014 Christian Kudahl (IMADA) On-line Chromatic Number July 7, 2014 1 / 20 When vertex, v, is revealed, it is revealed which vertices it is adjacent to (among those that were previously revealed). The algorithm assigns a color to v dierent from the colors it is already adjacent to. The color cannot be changed later. The goal is to use as few colors as possible. On-line graph coloring The vertices of a graph are revealed one by one. Christian Kudahl (IMADA) On-line Chromatic Number July 7, 2014 2 / 20 The algorithm assigns a color to v dierent from the colors it is already adjacent to. The color cannot be changed later. The goal is to use as few colors as possible. On-line graph coloring The vertices of a graph are revealed one by one. When vertex, v, is revealed, it is revealed which vertices it is adjacent to (among those that were previously revealed). Christian Kudahl (IMADA) On-line Chromatic Number July 7, 2014 2 / 20 The goal is to use as few colors as possible. On-line graph coloring The vertices of a graph are revealed one by one. When vertex, v, is revealed, it is revealed which vertices it is adjacent to (among those that were previously revealed). The algorithm assigns a color to v dierent from the colors it is already adjacent to. The color cannot be changed later.
    [Show full text]
  • Christopher Duffy , Gary Macgillivray , Pascal Ochem , André Raspaud
    ORIENTED INCIDENCE COLOURINGS OF DIGRAPHS Christopher Duffyd1, Gary MacGillivraya, Pascal Ochemb, André Raspaudc aDepartment of Mathematics and Statistics, University of Victoria, Canada bLIRMM, CNRS, Université de Montpellier, France cLaBRI UMR CNRS 5800 Université Bordeaux 1, France dDepartment of Mathematics and Statistics, Dalhousie University, Canada Abstract. Brualdi and Quinn Massey [4] defined incidence colouring while studying the strong edge chromatic index of bipartite graphs. Here we introduce a similar concept for di- graphs and define the oriented incidence chromatic number. Using digraph homomorphisms, we show that the oriented incidence chromatic number of a digraph is closely related to the chromatic number of the underlying simple graph. This motivates our study of the oriented incidence chromatic number of symmetric complete digraphs. We give upper and lower bounds for the oriented incidence chromatic number of these graphs, as well as digraphs arising from common graph constructions and decompositions. Additionally we construct, for all k > 2, a universal target for all digraphs with oriented incidence chromatic number k. 1. Introduction and preliminaries Let G be a simple graph. We obtain an orientation of G by assigning to each of the edges of G a direction to form a digraph. If a digraph is an orientation of a simple graph we refer to it as an oriented graph. A digraph is called semicomplete if it has a spanning tournament. Herein we assume that digraphs do not contain loops or parallel arcs. Since we are dealing −! primarily with digraphs, we will omit the over arrow (G is written as G and uv−! is written as uv) unless there is the possibility for confusion.
    [Show full text]
  • The Incidence Chromatic Number of Toroidal Grids Eric Sopena, Jiaojiao Wu
    The Incidence Chromatic Number of Toroidal Grids Eric Sopena, Jiaojiao Wu To cite this version: Eric Sopena, Jiaojiao Wu. The Incidence Chromatic Number of Toroidal Grids. Discussiones Mathe- maticae Graph Theory, University of Zielona Góra, 2013, 33, pp.315-327. hal-00406409v3 HAL Id: hal-00406409 https://hal.archives-ouvertes.fr/hal-00406409v3 Submitted on 6 May 2012 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. The Incidence Chromatic Number of Toroidal Grids Eric´ Sopena∗ and Jiaojiao Wu† Univ. Bordeaux, LaBRI, UMR5800, F-33400 Talence CNRS, LaBRI, UMR5800, F-33400 Talence May 6, 2012 Abstract An incidence in a graph G is a pair (v, e) with v ∈ V (G) and e ∈ E(G), such that v and e are incident. Two incidences (v, e) and (w,f) are adjacent if v = w, or e = f, or the edge vw equals e or f. The incidence chromatic number of G is the smallest k for which there exists a mapping from the set of incidences of G to a set of k colors that assigns distinct colors to adjacent incidences. In this paper, we prove that the incidence chromatic number of the toroidal grid Tm,n = Cm2Cn equals 5 when m,n ≡ 0 (mod 5) and 6 otherwise.
    [Show full text]
  • Strong Edge Colorings of Graphs and the Covers of Kneser Graphs Arxiv
    Strong edge colorings of graphs and the covers of Kneser graphs Borut Lužar,∗ Edita Mačajová,† Martin Škoviera,† Roman Soták,‡ January 14, 2021 Abstract A proper edge coloring of a graph is strong if it creates no bichromatic path of length three. It is well known that for a strong edge coloring of a k-regular graph at least 2k − 1 colors are needed. We show that a k-regular graph admits a strong edge coloring with 2k−1 colors if and only if it covers the Kneser graph K(2k−1; k−1). In particular, a cubic graph is strongly 5-edge-colorable whenever it covers the Petersen graph. One of the implications of this result is that a conjecture about strong edge colorings of subcubic graphs proposed by Faudree et al. [Ars Combin. 29 B (1990), 205–211] is false. Keywords: strong edge coloring, Petersen coloring, Kneser graph, odd graph, cubic graph, covering projection 1 Introduction A strong edge coloring of a graph G is a proper edge coloring with no bichromatic path of length three; in other words, each color class is an induced matching. The minimum number of colors for which G admits a strong edge coloring is called the strong chromatic 0 index, and is denoted by χs(G). In 1985, Erdős and Nešetřil proposed the following conjecture which was later published in [5] and updated by Faudree et al. [7] to fit the graphs with an even or odd maximum degree. Conjecture 1.1 (Erdős, Nešetřil, 1988). The strong chromatic index of an arbitrary graph arXiv:2101.04768v1 [math.CO] 12 Jan 2021 G satisfies ( 5 ∆(G)2 ; if ∆(G) is even χ0 (G) ≤ 4 s 1 2 4 (5∆(G) − 2∆(G) + 1) ; if ∆(G) is odd.
    [Show full text]
  • Total Game Coloring of Graphs
    TOTAL GAME COLORING OF GRAPHS T. BARTNICKI AND Z. MIECHOWICZ Abstract. Total variant of well known graph coloring game is considered. We determine ′′ exact values of χg for some classes of graphs and show that total game chromatic number is bounded from above by ∆ + 3∆+. We also show relation between total game coloring number and game coloring index. 1. Introduction Graph coloring game was first introduced in 1981 [6] by Steven Brams, but only after ten years graph game parameters were first time considered in mathematical paper [4] by Bod- laender. Various variants of graph coloring game have been studied until now. Profoundly explored is the original version of the game, in which players alternately color vertices of given graph (see survey [2]), but there is also a lot of results about game chromatic index, the parameter connected with game in which players color edges of a graph ([1],[3],[5]). Natural extension of this research is to consider a game in which players color both, vertices and edges of a graph. Let a graph G and a set of colors C be given. Total graph coloring game is a game with the following rules: • Two players, Alice and Bob alternately color vertices and edges of G, using colors from C with Alice playing first, • both players have to respect proper coloring rule: in each moment of the game each pair of incident objects in graph G (i.e. vertex-vertex, vertex-edge, edge-edge) have to receive different colors, • Alice wins if whole graph has been colored properly with available colors and Bob otherwise.
    [Show full text]
  • The Incidence Game Chromatic Number
    The incidence game chromatic number Stephan Dominique Andres Zentrum f¨ur angewandte Informatik K¨oln, University of Cologne, Weyertal 80, 50931 K¨oln, Germany Abstract We introduce the incidence game chromatic number which unifies the ideas of game chromatic number and incidence coloring number of an undirected graph. For k- degenerate graphs with maximum degree ∆, the upper bound 2∆ + 4k − 2 for the incidence game chromatic number is given. If ∆ ≥ 5k, we improve this bound to the value 2∆ + 3k − 1. We also determine the exact incidence game chromatic number 3 of cycles, stars and sufficiently large wheels and obtain the lower bound 2 ∆ for the incidence game chromatic number of graphs of maximum degree ∆. Key words: incidence coloring number, game chromatic number, k-degenerate graph, star, wheel, cycle, game chromatic index 2000 MSC: 05C15, 91A05 1 Introduction Let G = (V, E) be a graph with vertex set V and edge set E. The set of incidences of G is defined as I = {(v, e) ∈ V × E | v is incident with e}. Two distinct incidences (v, e), (w, f) ∈ I are adjacent if (v, f) ∈ I or (w, e) ∈ I. This means in particular, if either v = w or e = f, then the incidences (v, e) and (w, f) are adjacent. See Fig. 1. Email address: [email protected] (Stephan Dominique Andres). URL: http://www.math.uni-koeln.de/∼andres (Stephan Dominique Andres). Preprint submitted to Discrete Applied Mathematics 28 August 2007 (a) (b) Fig. 1. (a) pairs of adjacent incidences (b) pairs of non-adjacent incidences. A white dot denotes a vertex, a black dot on an edge e next to a vertex v denotes the incidence (v, e).
    [Show full text]
  • The Incidence Coloring Number of Halin Graphs and Outerplanar Graphs
    View metadata, citation and similar papers at core.ac.uk brought to you by CORE provided by Elsevier - Publisher Connector Discrete Mathematics 256 (2002) 397–405 www.elsevier.com/locate/disc The incidence coloringnumber of Halin graphs and outerplanar graphs Shu-DongWang a;b, Dong-Ling Chenb; ∗, Shan-Chen Pangb aDepartment of Control Science and Engineering, Huazhong University of Science and Technology, Wuhan, Hubei 430074, People’s Republic of China bCollege of Information Science and Engineering, Shandong University of Science and Technology, Taian, Shandong 271019, People’s Republic of China Received 29 January 2000; received in revised form 28 July 2000; accepted 2 April 2001 Abstract In this paper, we shall prove that the incidence coloringnumber for Halin graphsof maximum degree greater than or equal to 5 and outerplanar graphs of maximum degree greater than or equal to 4 is equal to the maximum degree of the graph plus 1. c 2002 Elsevier Science B.V. All rights reserved. MSC: O5C15 Keywords: Halin graph; Outerplanar graph; Incidencec oloring number; Incidence coloring 1. Introduction The concept of incidence coloringwas introduced by Brualdi and Massey [3]. Let G =(V; E) be a multigraph of order p and size q; I(G)={(v; e) | v ∈ V; e ∈ E; v is incident with e} be the set of incidences of G. We say that two incidences (v; e) and (w; f) are neighborly provided one of the following holds: (i) v = w; (ii) e = f; (iii) the edge vw equals e or f. An incidence coloringof G is a coloringof its incidences in which neighborly incidences are assigned di@erent colors.
    [Show full text]
  • UNIVERSITY of CALIFORNIA, SAN DIEGO Coloring Triangle-Free Graphs and Network Games a Dissertation Submitted in Partial Satisfac
    UNIVERSITY OF CALIFORNIA, SAN DIEGO Coloring Triangle-Free Graphs and Network Games A dissertation submitted in partial satisfaction of the requirements for the degree Doctor of Philosophy in Mathematics by Mohammad Shoaib Jamall Committee in charge: Professor Fan Chung Graham, Chair Professor Nageeb Ali Professor Samuel Buss Professor Ronald Graham Professor Jacques Verstraete 2011 Copyright Mohammad Shoaib Jamall, 2011 All rights reserved. The dissertation of Mohammad Shoaib Jamall is approved, and it is acceptable in quality and form for publication on microfilm: Chair University of California, San Diego 2011 iii TABLE OF CONTENTS Signature Page . iii Table of Contents . iv List of Figures . vi Acknowledgements . vii Vita and Publications . viii Abstract . ix Chapter 1 A brief introduction to graph coloring . 1 1.1 Graph coloring is hard . 3 1.2 Brooks' theorem . 4 1.3 Four colors suffice for a planar graph . 5 Chapter 2 Using probability to investigate graph coloring . 6 2.1 The Lovasz Local Lemma . 7 2.2 Talagrand's inequality and a bound on the chromatic number of triangle-free graphs . 8 2.3 The semi-random method . 9 Chapter 3 A Brooks' theorem for triangle-free graphs . 11 3.1 Introduction . 11 3.2 An Iterative Algorithm for Coloring a Graph . 12 3.2.1 A Sketch of the Algorithm and the Ideas behind its Analysis . 13 3.2.2 A Formal Description of the Algorithm . 17 3.3 The Main Theorem . 19 3.3.1 Bounding the Error Estimate in all Concentration Inequalities . 20 3.4 Several Useful Inequalities . 22 3.5 Proof of the Main Lemma .
    [Show full text]
  • Invalid Proofs on Incidence Coloring
    View metadata, citation and similar papers at core.ac.uk brought to you by CORE provided by Elsevier - Publisher Connector Discrete Mathematics 308 (2008) 6575–6580 www.elsevier.com/locate/disc Note Invalid proofs on incidence coloring W.C. Shiu∗, P.K. Sun Department of Mathematics, Hong Kong Baptist University, Kowloon Tong, Hong Kong, China Received 17 May 2007; received in revised form 14 November 2007; accepted 15 November 2007 Available online 26 December 2007 Abstract Incidence coloring of a graph G is a mapping from the set of incidences to a color-set C such that adjacent incidences of G are assigned distinct colors. Since 1993, numerous fruitful results as regards incidence coloring have been proved. However, some of them are incorrect. We remedy the error of the proof in [R.A. Brualdi, J.J.Q. Massey, Incidence and strong edge colorings of graphs, Discrete Math. 122 (1993) 51–58] concerning complete bipartite graphs. Also, we give an example to show that an outerplanar graph with ∆ D 4 is not 5-incidence colorable, which contradicts [S.D. Wang, D.L. Chen, S.C. Pang, The incidence coloring number of Halin graphs and outerplanar graphs, Discrete Math. 256 (2002) 397–405], and prove that the incidence chromatic number of the outerplanar graph with ∆ ≥ 7 is ∆ C 1. Moreover, we prove that the incidence chromatic number of the cubic Halin graph is 5. Finally, to improve the lower bound of the incidence chromatic number, we give some sufficient conditions for graphs that cannot be .∆ C 1/-incidence colorable. c 2007 Elsevier B.V.
    [Show full text]
  • On Characterizing Game-Perfect Graphs by Forbidden Induced Subgraphs
    Volume 7, Number 1, Pages 21{34 ISSN 1715-0868 ON CHARACTERIZING GAME-PERFECT GRAPHS BY FORBIDDEN INDUCED SUBGRAPHS STEPHAN DOMINIQUE ANDRES Abstract. A graph G is called g-perfect if, for any induced subgraph H of G, the game chromatic number of H equals the clique number of H. A graph G is called g-col-perfect if, for any induced subgraph H of G, the game coloring number of H equals the clique number of H. In this paper we characterize the classes of g-perfect resp. g-col-perfect graphs by a set of forbidden induced subgraphs. Moreover, we study similar notions for variants of the game chromatic number, namely B-perfect and [A; B]-perfect graphs, and for several variants of the game coloring number, and characterize the classes of these graphs. 1. Introduction A well-known maker-breaker game is one of Bodlaender's graph coloring games [9]. We are given an initially uncolored graph G and a color set C. Two players, Alice and Bob, move alternately with Alice beginning. A move consists in coloring an uncolored vertex with a color from C in such a way that adjacent vertices receive distinct colors. The game ends if no move is possible any more. The maker Alice wins if the vertices of the graph are completely colored, otherwise, i.e. if there is an uncolored vertex surrounded by colored vertices of each color, the breaker Bob wins. For a graph G, the game chromatic number χg(G) of G is the smallest cardinality of a color set C such that Alice has a winning strategy in the game described above.
    [Show full text]