DOCSLIB.ORG

Deterministic Distributed Edge-Coloring Via Hypergraph Maximal Matching

Total Page：16

File Type：pdf, Size：1020Kb

Download full-text PDF Read full-text

Load more

58th Annual IEEE Symposium on Foundations of Computer Science Deterministic Distributed Edge-Coloring via Hypergraph Maximal Matching Manuela Fischer and Mohsen Ghaffari Fabian Kuhn Department of Computer Science Department of Computer Science ETH Zurich University of Freiburg 8092 Zurich, Switzerland 79110 Freiburg, Germany manuela.fi[email protected] and [email protected] [email protected] Abstract—We present a deterministic distributed algorithm maximum degree Δ, and where each node has a Θ(log n)- that computes a (2Δ − 1)-edge-coloring, or even list-edge- bit unique identifier. Initially, nodes have knowledge of coloring, in any n-node graph with maximum degree Δ,in G n O 8 · n their neighbors in as well as log and log Δ up to (log Δ log ) rounds. This answers one of the long-standing 1 open questions of distributed graph algorithms from the late constants. At the end, each node should know its own 1980s, which asked for a polylogarithmic-time algorithm. See, part of the solution, e.g., the colors of its edges in edge- e.g., Open Problem 4 in the Distributed Graph Coloring book coloring. Communication happens in synchronous rounds, of Barenboim√ and Elkin. The previous best round complexities where in each round each node sends a message to each of O( log n) were√ 2 by Panconesi and Srinivasan [STOC’92] and its neighbors.2 The main complexity measure is the number O˜ O ∗ n ( Δ) + (log ) by Fraigniaud, Heinrich, and Kosowski of rounds needed for solving a given graph problem. The [FOCS’16]. A corollary of our deterministic list-edge-coloring also improves the randomized complexity of (2Δ − 1)-edge- four classic local distributed graph problems are Maximal coloring to poly(log log n) rounds. Independent Set (MIS), (Δ+1)-vertex-coloring, (2Δ − 1)- The key technical ingredient is a deterministic distributed edge-coloring, and maximal matching [PR01], [BE13]. All algorithm for hypergraph maximal matching, which we believe these problems have trivial greedy sequential algorithms, will be of interest beyond this result. In any hypergraph of as well as simple O(log n)-round randomized distributed rank r — where each hyperedge has at most r vertices — with algorithms [Lub86], [ABI86], and even some faster ones n nodes and maximum degree Δ, this algorithm computes a [BEPS12], [EPS15], [Gha16], [HSS16]. But the determin- maximal matching in O r5 6+log r · n rounds. ( log Δ log ) istic distributed complexity remains widely open, despite This hypergraph matching algorithm and its extensions extensive interest (see, e.g., the first five open problems also lead to a number of other results. In particular, we ob- of [BE13]). Particularly, with regards to MIS — which is tain a polylogarithmic-time deterministic distributed maximal independent set (MIS) algorithm for graphs with bounded the hardest of the four problems, as the other three can be neighborhood independence, hence answering Open Problem reduced to MIS locally [Lin87] — Linial [Lin92] asked O /ε 5 of Barenboim and Elkin’s book, a (log Δ/ε) (log 1 ) - “can it [MIS] always be found [deterministically] in ε round deterministic algorithm for (1 + )-approximation of polylogarithmic time?”. maximum matching, and a quasi-polylogarithmic-time deter- λ This remains the most well-known open question√ of the ministic distributed algorithm for orienting -arboricity graphs O n with out-degree at most (1 + ε)λ, for any constant ε>0, area. The best known round complexity is 2 ( log ), due hence partially answering Open Problem 10 of Barenboim and to Panconesi and Srinivasan [PS92]. Panconesi and Rizzi Elkin’s book. pointed out in the year 2001 [PR01] that “while maximal Keywords-distributed graph algorithms; local algorithms; de- matchings can be computed in polylogarithmic time, in n, terministic distributed algorithms; edge-coloring; hypergraph; in the distributed model [HKP98], it is a decade old open maximal matching; rounding linear programs problem whether the same running time is achievable for the remaining 3 structures.” The status remains the same I. INTRODUCTION as of today, after almost two more decades. In particular, Distributed graph algorithms have been studied exten- for edge-coloring which is our main target, Barenboim and sively over the past 30 years, since the seminal work of Elkin stated the following problem in their recent Distributed Linial [Lin87]. Despite this, determining whether there are efficient deterministic distributed algorithms for the most 1If the latter is not the case, it is enough to try exponentially increasing classic problems of the area remains a long-standing open estimates. 2In the LOCAL model, messages might be of arbitrary size. A variant question. of the model where the messages have to be of bounded size is known Distributed graph algorithms are typically studied in a as the CONGEST model [Pel00]. Our edge-coloring algorithms and our MIS and vertex-coloring algorithms for graphs of bounded neighborhood standard synchronous message passing model known as the O n LOCAL independence in fact work with small (log )-bit-size messages. Though, model [Lin87], [Pel00]: the network is abstracted for the sake of the readability, we avoid explicitly discussing the details of as an undirected graph G =(V,E), n = |V |, with this aspect. 0272-5428/17 $31.00 © 2017 IEEE 180 DOI 10.1109/FOCS.2017.25 √ Graph Coloring book [BE13]: (2Δ − 1)-edge-coloring was 2O( log log n) rounds3, due to OPEN PROBLEM 11.4 [BE13]: Devise or rule out a Elkin, Pettie, and Su [EPS15]. By improving this, Corol- deterministic (2Δ − 1)-edge-coloring algorithm that lary I.2 widens the provable gap between the complexity runs in polylogarithmic time. of (2Δ − 1)-edge-coloring, which is now in poly(log log n) rounds, and the complexity of maximal matching, which A. Our Contributions needs Ω( log n/ log log n) rounds [KMW16]. Deterministic Edge-Coloring Algorithm: One of our main end results is a positive resolution of the above question. Unified Formulation as Hypergraph Maximal Matching: Our first step towards proving Theorem I.1 is a simple Theorem I.1. There is a deterministic distributed algorithm 8 unification of all the aforementioned four classic problems: that computes a (2Δ−1)-edge-coloring in O(log Δ·log n) − n MIS, (Δ+1)-vertex-coloring, (2Δ 1)-edge-coloring, and rounds, in any -node graph with maximum degree Δ. More- maximal matching. We can cast each of these problems as over, the same algorithm solves list-edge-coloring, where 4 e ∈ E a maximal matching problem on hypergraphs of some rank each edge must get a color from an arbitrary given r, which depends on the problem, and increases as we move list Le of colors with |Le| = de +1, where de denotes the e from maximal matching to maximal independent set. In number of edges incident to . other words, the hypergraph maximal matching problem can For list-edge-coloring,√ the previously best known round be used to obtain a smooth interpolation between maximal complexity was 2O( log n), by a classic network decom- matching in graphs and maximal independent set in graphs. position of Panconesi and√ Srinivasan [PS92], which it- Recall that the rank of a hypergraph is the maximum number self improved on an 2O( log n·log log n)-round algorithm of of vertices in any of its hyperedges. Moreover, a matching Awerbuch et al. [ALGP89].√ For low-degree graphs, the in a hypergraph is a set of hyperedges, no two of which ∗ best known is an (O˜( Δ) + O(log n))-round algorithm share an endpoint. of Fraigniaud, Heinrich, and Kosowski [FHK16], which is We present a reduction from (2Δ − 1)-edge-coloring to more general and applies also to (Δ+1)-list-vertex-coloring. maximal matching in rank-3 hypergraphs, as we sketch next There are some known poly log n-round deterministic edge- in Lemma I.3. A similar reduction can be used for list-edge- coloring algorithms, but all have two major shortcomings: coloring, as formalized in Lemma III.1. We note that these (A) they require more colors, and (B) they are quite re- reductions are inspired by the well-known reduction of Luby stricted and do not work for list-coloring. These algorithms from (Δ + 1)-vertex-coloring to MIS [Lub86], [Lin87]. are as follows: (I) a ((2+o(1))Δ)-edge-coloring by Ghaffari O log Δ and Su [GS17]; (II) a Δ · 2 ( log log Δ )-edge-coloring by Lemma I.3. Given a deterministic distributed algo- Barenboim and Elkin [BE11]—see also [GS17, Appendix rithm A that computes a maximal matching in N- B] for a short proof; and (III) an O(Δ log n)-edge-coloring vertex hypergraphs of rank 3 and maximum degree d by Czygrinow et al. [CHK01]. See also [BE11, Chapter 8]. in T (N,d) rounds, there is a deterministic distributed B − We also note that a recent work of Barenboim, Elkin, algorithm that computes a (2Δ 1)-edge-coloring of n G V,E and Maimon [BEM17] presents an efficient deterministic any -node graph =( ) with maximum degree T n , − algorithm for computing a (Δ + o(Δ))-edge-coloring in Δ in at most (3 Δ 2Δ 1) rounds. −δ G V,E graphs with arboricity a ≤ Δ1 , for some constant δ>0. Proof Sketch: To edge-color =( ),we H − G In Corollary IV.1, we sketch how a simple combination of generate a hypergraph : Take 2Δ 1 copies of .For e ∈ E e e the list-edge-coloring algorithm of Theorem I.1 with H- each edge , let 1 to 2Δ−1 be its copies. For each e ∈ E w H partitionings [BE13, Chapter 5.1] significantly extends their , add one extra vertex e to and then, change e e result.
Recommended publications
  • A Brief History of Edge-Colorings — with Personal Reminiscences

    A Brief History of Edge-Colorings — with Personal Reminiscences

    Discrete Mathematics Letters Discrete Math. Lett. 6 (2021) 38–46 www.dmlett.com DOI: 10.47443/dml.2021.s105 Review Article A brief history of edge-colorings – with personal reminiscences∗ Bjarne Toft1;y, Robin Wilson2;3 1Department of Mathematics and Computer Science, University of Southern Denmark, Odense, Denmark 2Department of Mathematics and Statistics, Open University, Walton Hall, Milton Keynes, UK 3Department of Mathematics, London School of Economics and Political Science, London, UK (Received: 9 June 2020. Accepted: 27 June 2020. Published online: 11 March 2021.) c 2021 the authors. This is an open access article under the CC BY (International 4.0) license (www.creativecommons.org/licenses/by/4.0/). Abstract In this article we survey some important milestones in the history of edge-colorings of graphs, from the earliest contributions of Peter Guthrie Tait and Denes´ Konig¨ to very recent work. Keywords: edge-coloring; graph theory history; Frank Harary. 2020 Mathematics Subject Classification: 01A60, 05-03, 05C15. 1. Introduction We begin with some basic remarks. If G is a graph, then its chromatic index or edge-chromatic number χ0(G) is the smallest number of colors needed to color its edges so that adjacent edges (those with a vertex in common) are colored differently; for 0 0 0 example, if G is an even cycle then χ (G) = 2, and if G is an odd cycle then χ (G) = 3. For complete graphs, χ (Kn) = n−1 if 0 0 n is even and χ (Kn) = n if n is odd, and for complete bipartite graphs, χ (Kr;s) = max(r; s).
  • When the Vertex Coloring of a Graph Is an Edge Coloring of Its Line Graph — a Rare Coincidence

    When the Vertex Coloring of a Graph Is an Edge Coloring of Its Line Graph — a Rare Coincidence

    View metadata, citation and similar papers at core.ac.uk brought to you by CORE provided by Repository of the Academy's Library When the vertex coloring of a graph is an edge coloring of its line graph | a rare coincidence Csilla Bujt¶as 1;¤ E. Sampathkumar 2 Zsolt Tuza 1;3 Charles Dominic 2 L. Pushpalatha 4 1 Department of Computer Science and Systems Technology, University of Pannonia, Veszpr¶em,Hungary 2 Department of Mathematics, University of Mysore, Mysore, India 3 Alfr¶edR¶enyi Institute of Mathematics, Hungarian Academy of Sciences, Budapest, Hungary 4 Department of Mathematics, Yuvaraja's College, Mysore, India Abstract The 3-consecutive vertex coloring number Ã3c(G) of a graph G is the maximum number of colors permitted in a coloring of the vertices of G such that the middle vertex of any path P3 ½ G has the same color as one of the ends of that P3. This coloring constraint exactly means that no P3 subgraph of G is properly colored in the classical sense. 0 The 3-consecutive edge coloring number Ã3c(G) is the maximum number of colors permitted in a coloring of the edges of G such that the middle edge of any sequence of three edges (in a path P4 or cycle C3) has the same color as one of the other two edges. For graphs G of minimum degree at least 2, denoting by L(G) the line graph of G, we prove that there is a bijection between the 3-consecutive vertex colorings of G and the 3-consecutive edge col- orings of L(G), which keeps the number of colors unchanged, too.
  • On Vertex Independence Number of Uniform Hypergraphs

    On Vertex Independence Number of Uniform Hypergraphs

    Acta Univ. Sapientiae, Informatica, 6, 1 (2014) 132{158 On vertex independence number of uniform hypergraphs Tariq A. CHISHTI Guofei ZHOU University of Kashmir Nanjing University Department of Mathematics Department of Mathematics Srinagar, India Nanjing, China email: [email protected] email: [email protected] Shariefuddin PIRZADA Antal IVANYI´ University of Kashmir E¨otv¨osLor´andUniversity Department of Mathematics Faculty of Informatics Srinagar, India Budapest, Hungary email: email: [email protected] [email protected] Abstract. Let H be an r-uniform hypergraph with r ≥ 2 and let α(H) be its vertex independence number. In the paper bounds of α(H) are given for different uniform hypergraphs: if H has no isolated vertex, then in terms of the degrees, and for triangle-free linear H in terms of the order and average degree. 1 Introduction to independence in graphs Let n be a positive integer. A graph G on vertex set V = fv1; v2; : : : ; vng is a pair (V; E), where the edge set E is a subset of V × V. n is the order of G and jEj is the size of G. Computing Classification System 1998: G.2.2 Mathematics Subject Classification 2010: 05C30, 05C50 Key words and phrases: uniform hypergraph, independence number, lower bound DOI:10.2478/ausi-2014-0022 132 On vertex independence number of uniform hypergraphs 133 Let v 2 V and N(v) be the neighborhood of v, namely, the set of vertices x so that there is an edge which contains both v and x. Let U be a subset of V, then the subgraph of G induced by U is defined as a graph on vertex set U and edge set EU = f(u; v)ju 2 u and v 2 Ug.
  • Interval Edge-Colorings of Graphs

    Interval Edge-Colorings of Graphs

    University of Central Florida STARS Electronic Theses and Dissertations, 2004-2019 2016 Interval Edge-Colorings of Graphs Austin Foster University of Central Florida Part of the Mathematics Commons Find similar works at: https://stars.library.ucf.edu/etd University of Central Florida Libraries http://library.ucf.edu This Masters Thesis (Open Access) is brought to you for free and open access by STARS. It has been accepted for inclusion in Electronic Theses and Dissertations, 2004-2019 by an authorized administrator of STARS. For more information, please contact [email protected]. STARS Citation Foster, Austin, "Interval Edge-Colorings of Graphs" (2016). Electronic Theses and Dissertations, 2004-2019. 5133. https://stars.library.ucf.edu/etd/5133 INTERVAL EDGE-COLORINGS OF GRAPHS by AUSTIN JAMES FOSTER B.S. University of Central Florida, 2015 A thesis submitted in partial fulfilment of the requirements for the degree of Master of Science in the Department of Mathematics in the College of Sciences at the University of Central Florida Orlando, Florida Summer Term 2016 Major Professor: Zixia Song ABSTRACT A proper edge-coloring of a graph G by positive integers is called an interval edge-coloring if the colors assigned to the edges incident to any vertex in G are consecutive (i.e., those colors form an interval of integers). The notion of interval edge-colorings was first introduced by Asratian and Kamalian in 1987, motivated by the problem of finding compact school timetables. In 1992, Hansen described another scenario using interval edge-colorings to schedule parent-teacher con- ferences so that every person’s conferences occur in consecutive slots.
  • Qualitative Reasoning for Spatial Matching 1 Dwolter@Sfbtr8.Uni-Bremen.De Qualitative Reasoning for Spatial Matching

    Qualitative Reasoning for Spatial Matching 1 [email protected] Qualitative Reasoning for Spatial Matching

    Qualitative Reasoning for Spatial Matching 1 [email protected] Qualitative Reasoning for Spatial Matching Diedrich Wolter Universit¨atBremen, Transregional Collaborative Research Center SFB/TR 8 Spatial Cognition Abstract. Matching two representations against one another is central to many applications, e.g., matching observation against models in ob- ject or scene recognition or matching a local perception against a global map in self-localization if a mobile robot. In both examples, spatial infor- mation structures are associated, i.e., the representation includes spatial arrangement information of individual parts, either in a relative or an absolute frame of reference. In this paper the utility of qualitative configuration information for matching is investigated. Qualitative configuration information expresses relative arrangement information. It is argued that such information is helpful for making side conditions of plausible matchings explicit, which can improve matching efficiency as well as quality of the matching. Keywords. Matching, Qualitative Spatial Information 1 Introduction Many applications involve the task of matching two representations against one another. For example scene recognition involves identifying a set of spatially distributed objects. Many objects bear rich information which can be exploited the recognition task, but it is information about the spatial arrangement of the involved objects that allows for important distinctions. Consider you are observing a scene that contains dishes, glasses, and sets of cutlery. These objects, when nicely arranged on a table, gives rise to the hypothesis that you are about to enjoy a nice meal, whereas piled up dishes, glasses, and clutter of cutlery suggests dish washing to be your destiny. This article investigates into matching tasks which are involved with match- ing spatially embedded representations, i.e.
  • Vizing's Theorem and Edge-Chromatic Graph

    Vizing's Theorem and Edge-Chromatic Graph

    VIZING'S THEOREM AND EDGE-CHROMATIC GRAPH THEORY ROBERT GREEN Abstract. This paper is an expository piece on edge-chromatic graph theory. The central theorem in this subject is that of Vizing. We shall then explore the properties of graphs where Vizing's upper bound on the chromatic index is tight, and graphs where the lower bound is tight. Finally, we will look at a few generalizations of Vizing's Theorem, as well as some related conjectures. Contents 1. Introduction & Some Basic Definitions 1 2. Vizing's Theorem 2 3. General Properties of Class One and Class Two Graphs 3 4. The Petersen Graph and Other Snarks 4 5. Generalizations and Conjectures Regarding Vizing's Theorem 6 Acknowledgments 8 References 8 1. Introduction & Some Basic Definitions Definition 1.1. An edge colouring of a graph G = (V; E) is a map C : E ! S, where S is a set of colours, such that for all e; f 2 E, if e and f share a vertex, then C(e) 6= C(f). Definition 1.2. The chromatic index of a graph χ0(G) is the minimum number of colours needed for a proper colouring of G. Definition 1.3. The degree of a vertex v, denoted by d(v), is the number of edges of G which have v as a vertex. The maximum degree of a graph is denoted by ∆(G) and the minimum degree of a graph is denoted by δ(G). Vizing's Theorem is the central theorem of edge-chromatic graph theory, since it provides an upper and lower bound for the chromatic index χ0(G) of any graph G.
  • Curriculum Vitae Prof. Dr. Anand Srivastav Personal Data Name Prof

    Curriculum Vitae Prof. Dr. Anand Srivastav Personal Data Name Prof

    Curriculum Vitae Prof. Dr. Anand Srivastav Personal Data Name Prof. Dr. Anand Srivastav (Dipl. Math., Dipl. Phys.) Place/Date of Birth Agra (India), in 1958 Affiliation Institution Christian-Albrechts-Universität zu Kiel (CAU) Institute Department of Computer Science Address Christian-Albrechts-Platz 4, D-24118 Kiel, Germany Phone / Fax +49 431 880-7252 / -1725 E-Mail [email protected] Education 1996 Habilitation in Computer Science, Freie Universität zu Berlin, Germany 1988 Dr. rer. nat. (in Mathematics), Westfälische Wilhelms-Universität Münster 1988 Dipl. Phys. degree (Master of Physics), Westfälische Wilhelms-Universität Münster, Germany 1984 Dipl. Math. degree (Master of Mathematics), Westfälische Wilhelms- Universität Münster, Germany 1978 – 1984 Study of Physics and Mathematics at the Westfälische Wilhelms- Universität Münster, Germany 1965 – 1978 School Education in India and Germany Academic Appointments since 1997 Professor for Mathematics (Discrete Optimization), Christian-Albrechts- Universität zu Kiel 1995 – 1997 Assistent Professor at the Computer Science Department, Humboldt- Universität zu Berlin 1994 – 1995 Visiting Professor at the Computer Science Department, Freie Universität Berlin 1993 – 1994 Visiting Professor at IMA (University of Minnesota), Courant Institute for Mathematical Sciences (New York University) and Yale University, USA 1988 – 1993 Assistent Professor, Institute for Discrete Mathematics, Rheinische Friedrich- Wilhelms-Universität Bonn Important Functions since 2008 Co-Speaker of the Research
  • Matchings in Balanced Hypergraphs

    Matchings in Balanced Hypergraphs

    Matchings in balanced hypergraphs Von der Fakultat¨ fur¨ Mathematik, Informatik und Naturwissenschaften der RWTH Aachen University zur Erlangung des akademischen Grades eines Doktors der Naturwissenschaften genehmigte Dissertation vorgelegt von Diplom-Mathematiker Robert Berthold Scheidweiler aus Duren-Birkesdorf.¨ Berichter: Universitatsprofessor¨ Dr. Eberhard Triesch Universitatsprofessor¨ Dr. Arie M.C.A. Koster Tag der mundlichen¨ Prufung:¨ 19. April 2011 Diese Dissertation ist auf den Internetseiten der Hochschulbibliothek online verfugbar.¨ Danksagung In den letzten funf¨ Jahren habe ich am Lehrstuhl II fur¨ Mathematik der RWTH Aachen Uni- versity die vorliegende Dissertation verfasst. Einigen gebuhrt¨ fur¨ ihre Unterstutzung¨ und Hilfe wahrend¨ dieser Zeit besonderer Dank. Zuallererst mochte¨ ich mich bei dem Betreuer meiner Dissertation und meinem Chef, Eberhard Triesch, bedanken. Durch ihn habe ich das Thema dieser Arbeit erhalten, das mir sehr ans Herz gewachsen ist. Er hat mir bei meinen Forschungen immer mit Rat und Tat zur Seite gestanden und mich auch bei langer¨ andauern- den Durststrecken niemals unter Druck gesetzt. Seine positive Unterstutzung¨ und geduldige Hilfe haben mich motiviert, diese Arbeit zu vollenden. Weiterhin mochte¨ ich mich bei Arie Koster, meinem Zweitgutachter, bedanken. Mehrfach hat er im Verlauf meiner Promotion Anregungen gegeben, die dann in die Dissertation eingeflossen sind. Vor der endgultigen¨ Ab- gabe hat er durch seine Verbesserungsvorschlage,¨ fur¨ die ich sehr dankbar bin, zur jetzigen Form der Arbeit beigetragen. Danken mochte¨ ich außerdem Bert Randerath, der mir half, einige Startschwierigkeiten zu uberwinden,¨ als ich begann, die balancierten Hypergraphen zu erforschen. Hartmut Fuhr¨ hat sehr viel Zeit darauf verwendet, mir die harmonische Analysis naher¨ zu bringen. Seine Bemuhungen¨ haben meine Promotion weiter voran gebracht.
  • Acyclic Edge-Coloring of Planar Graphs

    Acyclic Edge-Coloring of Planar Graphs

    Acyclic edge-coloring of planar graphs: ∆ colors suffice when ∆ is large Daniel W. Cranston∗ January 31, 2019 Abstract An acyclic edge-coloring of a graph G is a proper edge-coloring of G such that the subgraph ′ induced by any two color classes is acyclic. The acyclic chromatic index, χa(G), is the smallest ′ number of colors allowing an acyclic edge-coloring of G. Clearly χa(G) ∆(G) for every graph G. Cohen, Havet, and M¨uller conjectured that there exists a constant M≥such that every planar ′ graph with ∆(G) M has χa(G) = ∆(G). We prove this conjecture. ≥ 1 Introduction proper A proper edge-coloring of a graph G assigns colors to the edges of G such that two edges receive edge- distinct colors whenever they have an endpoint in common. An acyclic edge-coloring is a proper coloring acyclic edge-coloring such that the subgraph induced by any two color classes is acyclic (equivalently, the edge- ′ edges of each cycle receive at least three distinct colors). The acyclic chromatic index, χa(G), is coloring the smallest number of colors allowing an acyclic edge-coloring of G. In an edge-coloring ϕ, if a acyclic chro- color α is used incident to a vertex v, then α is seen by v. For the maximum degree of G, we write matic ∆(G), and simply ∆ when the context is clear. Note that χ′ (G) ∆(G) for every graph G. When index a ≥ we write graph, we forbid loops and multiple edges. A planar graph is one that can be drawn in seen by planar the plane with no edges crossing.
  • NP-Completeness of List Coloring and Precoloring Extension on the Edges of Planar Graphs

    NP-Completeness of List Coloring and Precoloring Extension on the Edges of Planar Graphs

    NP-completeness of list coloring and precoloring extension on the edges of planar graphs D´aniel Marx∗ 17th October 2004 Abstract In the edge precoloring extension problem we are given a graph with some of the edges having a preassigned color and it has to be decided whether this coloring can be extended to a proper k-edge-coloring of the graph. In list edge coloring every edge has a list of admissible colors, and the question is whether there is a proper edge coloring where every edge receives a color from its list. We show that both problems are NP-complete on (a) planar 3-regular bipartite graphs, (b) bipartite outerplanar graphs, and (c) bipartite series-parallel graphs. This improves previous results of Easton and Parker [6], and Fiala [8]. 1 Introduction In graph vertex coloring we have to assign colors to the vertices such that neighboring vertices receive different colors. Starting with [7] and [28], a gener- alization of coloring was investigated: in the list coloring problem each vertex can receive a color only from its prescribed list of admissible colors. In the pre- coloring extension problem a subset W of the vertices have preassigned colors and we have to extend this precoloring to a proper coloring of the whole graph, using only colors from a given color set C. It can be viewed as a special case of list coloring: the list of a precolored vertex consists of a single color, while the list of every other vertex is C. A thorough survey on list coloring, precoloring extension, and list chromatic number can be found in [26, 1, 12, 13].
  • 31 Aug 2020 Injective Edge-Coloring of Sparse Graphs

    31 Aug 2020 Injective Edge-Coloring of Sparse Graphs

    Injective edge-coloring of sparse graphs Baya Ferdjallah1,4, Samia Kerdjoudj 1,5, and André Raspaud2 1LIFORCE, Faculty of Mathematics, USTHB, BP 32 El-Alia, Bab-Ezzouar 16111, Algiers, Algeria 2LaBRI, Université de Bordeaux, 351 cours de la Libération, 33405 Talence Cedex, France 4Université de Boumerdès, Avenue de l’indépendance, 35000, Boumerdès, Algeria 5Université de Blida 1, Route de Soumâa BP 270, Blida, Algeria September 1, 2020 Abstract An injective edge-coloring c of a graph G is an edge-coloring such that if e1, e2, and e3 are three consecutive edges in G (they are consecutive if they form a path or a cycle of length three), then e1 and e3 receive different colors. The minimum integer k such that, G has an injective edge-coloring with k ′ colors, is called the injective chromatic index of G (χinj(G)). This parameter was introduced by Cardoso et al. [12] motivated by the Packet Radio Network ′ problem. They proved that computing χinj(G) of a graph G is NP-hard. We give new upper bounds for this parameter and we present the rela- tionships of the injective edge-coloring with other colorings of graphs. The obtained general bound gives 8 for the injective chromatic index of a subcubic graph. If the graph is subcubic bipartite we improve this last bound. We prove that a subcubic bipartite graph has an injective chromatic index bounded by arXiv:1907.09838v2 [math.CO] 31 Aug 2020 6. We also prove that if G is a subcubic graph with maximum average degree 7 8 less than 3 (resp.
  • A Multigraph May Contain Parallel Edges. Definition 1 Edge Coloring Of

    A Multigraph May Contain Parallel Edges. Definition 1 Edge Coloring Of

    Edge Coloring A multigraph may contain parallel edges. Definition 1 Edge coloring of a graph G is an assignment of colors to its edges so that adjacent edges are assigned distinct colors. Definition 2 The chromatic index, or the edge-chromatic number of a graph G is the smallest integer n for which there is an edge coloring of G which uses n colors. 1 Edge coloring is a special case of vertex coloring. Definition 3 For a given G = (V,E), the line graph L(G) is a graph H whose set of vertices is E and the set of edges consists of all pairs (ei,e2) where e1 and e2 are adjacent edges in G. Theorem 1 For a simple graph H, there is a solution G to L(G)= H iff H decomposes into complete subgraphs, with each vertex of H appearing in at most two of these complete subgraphs. Proposition 1 Every edge coloring is a partition of the edges into matchings. Proposition 2 There is an edge-coloring of G in n colors iff there is a vertex coloring of L(G) which uses n colors. 2 For a graph G, χ′(G) and ∆(G) denote the chromatic index and the maximum vertex degree respectively. Theorem 2 ∀G, χ′(G) ≥ ∆(G). Proof. Obvious. Theorem 3 ∀G, χ′(G) ≤ 2∆(G) − 1. Proof. Apply the greedy algorithm: color edges one-by-one, using for each edge the smallest positive integer which is available. Theorem 4 ∀G, if G is bipartite, then χ′(G)=∆(G). Proof. Not obvious.