DOCSLIB.ORG

Gerhard Ringel Rainer Bodendiek

Total Page：16

File Type：pdf, Size：1020Kb

Download full-text PDF Read full-text
Gerhard Ringel Rainer Bodendiek Gerhard Ringel Rainer Bodendiek . Rudolf Henn (Eds.) Topics in Combinatorics and Graph Theory Essays in Honour of Gerhard Ringel With 178 Figures Physica-Verlag Heidelberg Professor Dr. Rainer Bodendiek Institut flir Mathematik und ihre Didaktik Padagogische Hochschule Kiel OlshausenstraBe 75 2300 Kiel, FRG Professor Dr. RudolfHenn (died 1989) Institut flir Statistik und Mathematische Wirtschaftstheorie Universitat Karlsruhe Rechenzentrum, Zirkel 2 Postfach 6980 7500 Karlsruhe, FRG ISBN-13: 978-3-642-46910-7 e-ISBN-13: 978-3-642-46908-4 DOl: 10.1007/978-3-642-46908-4 CIP-Titelaufnahme der Deutschen Bibliothek Topics in combinatorics and graph theory: essays in honour of Gerhard RingellRainer Bodendiek; Rudolf Henn (eds.). - Heidelberg: Physica-VerJ., 1990 ISBN-13: 978-3-642-46910-7 NE: Bodendiek, Rainer [Hrsg.); Ringel, Gerhard: Festschrift This work is subject to copyright. All rights are reserved, whether the whole orpart ofthe material is con­ cerned, specifically the rights oftranslation, reprinting, reuse of illustrations, recitation, broadcasting, reproduction on microfilms or in other ways, and storage in data banks. Duplication ofthis pUblication or parts thereof is only permitted under the provisions of the German Copyright Law of September 9, 1965, in its version ofJune 24,1985, and a copyright fee must always be paid. Violations fall under the pro­ secution act of the German Copyright Law. © Physica-VerJag Heidelberg 1990 Softcover reprint of the hardcover 1st edition 1990 The use ofregistered names, trademarks, etc. in this publication does not imply, even in the absence of a specific statement, that such names are exempt from the relevant protective laws and regulations and therefore free for general use. 7120/7130-543210 Preface Graph theory and combinatorics are two different areas of discrete mathe­ matics. Although graph theory is intimately related to combinatorics and it is not always easy to decide whether certain contributions belong to graph theory or combinatorics. it_is obvious that graph theory is not a part of combinatorics. This means:that these ~WQ areas are two independent members of discrete mathematfcs.' Furthermore,.it is nearly superfluous to mention that there are a lot of applications of graph theory to some areas of physics, chemistry, commuciation science, computer technology, operatio­ nal research, psychology, linguistics, economics and a great number of branches of mathematics including group theory, matrix theory, numerical analysis, probability, topology and combinatorics. Therefore, it is not very surprising that the graph theory has got a fan­ tastic development during the last thirty years. The number of graph theorists and of papers dealing with graph theoretical topics increases enormously. It is allowed to mention the graph theorists Klaus Wagner, Gerhard Ringel and Horst Sachs as pioneers of graph theory in Germany. Since one of them, Gerhard Ringel, has become 70 last year (1989) , we chose the Thursday during the graph theory meeting, held at Oberwolfach from 3-9 June 1990, to honour the work of Gerhard Ringel. About 50 mathematicians from 15 countries participated in lectures and discussions on graph theory related to Ringel's work. Gerhard Ringel is among the most quoted graph theorists. He has developed concepts and methods of great originality, made a lot of fundamental discoveries and conjectures, and has seen the necessity to introduce graph theory in economics. In order to manage a fruitful cooperation between economics and graph theory Gerhard Ringel worked together with the economist Rudolf Henn, the co-editor of this volume. Rudolf Henn died in November 1989. Although he was not a mathematician he became a great friend of the graph theory and introduced various graph theoretical methods in economics and wrote several books dealing with a lot of topics of graph theory in economics. VI Although he was seriously ill,he managed to settle the arising problems in a wonderful manner such that it was a great honour to me to work together with Rudolf Henn. This volume contains 86 contributions in honour of Gerhard Ringel given by 128 authors from 22 countries. I wish to thank all the contributors. I also thank Gerda Schmidt and Dr. Claus Thies who have helped preparing and typing the manuscripts. Professor Heiko Harborth is thanked for giving the appreciation of Gerhard Ringel. Finally, we are especially grateful to Dr. Werner A. MOller from Physica-Verlag for his cooperation in all aspects of the production of this book. Rainer Bodendiek Contents GERHARD RINGEL - SEVENTY XIII H. Harborth ON THE PROBLEM OF RELATIVE COMPONENTS OF MINIMAL GRAPHS R. Bodendiek / K. Wagner IRREGULAR ASSIGNMENTS AND TWO PROBLEMS a la RINGEL 29 M. Aigner / E. Triesch A RECURSIVE BOUND FOR THE NUMBER OF COMPLETE K-SUBGRAPHS OF A GRAPH 37 R. Ahlswede / N. Cai / Z. Zhang ONE-FACTORIZATIONS OF TENSOR PRODUCTS OF GRAPHS 41 B. Alspach / J.C. George NON-COMMUTATIVE GEOMETRY AND GRAPHS 47 J. Andre THE COMPLEXITY OF THE GRAPH EMBEDDING PROBLEM 59 D. Archdeacon HELLY THEOREMS FOR DISMANTLABLE GRAPHS AND PSEUDO-MODULAR GRAPHS 65 H.-J. Bandelt / H.M. Mulder ON THE LEVEL-ORIENTED TWO-DIMENSIONAL PACKING WITH ROTATION 73 OF THE RECTANGLES G. B!ir ON PLANAR TILINGS WITH FINITELY MANY SORTS OF TILES 79 K. Bezdek EXAMPLES OF SPACE-TILING POLYHEDRA RELATED TO HILBERTS PROBLEM 18. 87 QUESTION 2 A. Bezdek / W. Kuperberg THE HISTORICAL BACKGROUND TO GERHARD RINGEL's WORK 93 N.L. Biggs / E.K. Lloyd / R.J. Wilson AROUND THREE LEMMAS IN HAMILTONIAN GRAPH THEORY 101 D. Bauer / H.J. Broersma / H.J. Veldman A NOTE ON METRIC PROPERTIES OF INFINITE GRAPHS 111 T. BOhme AUTOMOTPHISM GROUPS OF DIRECTED CAYLEY GRAPHS 117 U. Baumann / M. Lesch / I. Schmeichel TRIANGULAR EMBEDDINGS OF TENSOR PRODUCTS OF GRAPHS 129 A. Bouchet / B. Mohar VIII COMPUTING LIGHT EDGES IN PLANAR GRAPHS 137 O.V. Borodin ON THE DOMINATION PROBLEM FOR BIPARTITE GRAPHS 145 A. Brandstadt POLYHEDRAL MAPS WITH FEW EDGES 153 U. Brehm AUT Gm,n FOR THE HASSE GRAPH Gm,n OF THE SUBWORD POSET Bm,n 163 OF AN m-ARY CYCLIC WORD OF LENGTH n G. Burosch / J.-M. Laborde STATUS OF GRACEFUL TREE CONJECTURE IN 1989 175 I. Cahit EMBEDDED GRAPHS, FACIAL COLORINGS, AND DOUBLE CYCLE COVERS 185 P.A. Catlin ON PERIPHERAL VERTICES IN GRAPHS 193 G. Chartrand / G. Johns / O.R. Oellermann THE VERTEX-DEGREES OF STEINER MINIMAL TREES IN MINKOWSKI PLANES 201 D. Cieslik UNFOLDING WEIGHTED CONCENSUS ORDERS 207 INTO CONSISTENT NUMERICAL SCALES J. Czyzowicz / A. Pelc / I. Rival FORBIDDEN ORDERED SUBGRAPHS 219 P. Damaschke ON NORMAL TOURNAMENTS WITH THE LEAST NUMBER OF 3-CYCLES 231 D.C. Demaria / G.M. Gianella TWO-IRREGULAR GRAPHS 239 R.J. Faudree / R.J. Gould / M.S. Jacobsen / R.H. Schelp CELL COMPLEXES AND LOWER BOUNDS IN COMPUTATIONAL GEOMETRY 249 T. Fischer CHARACTERIZING DIRECTED POSTMAN TOURS 257 H. Fleischner / E. Wenger SOME PROPERTIES OF "ALMOST ALL" FUNCTIONS FROM Pk 263 I.D. Giudjenov COMPOSITION OF FACETS OF THE CLIQUE PARTITIONING POLYTOPE 271 M. Gr5tschel / Y. Wakabayashi OPTIMAL EDGE-NUMBERING OF BINARY TREES 285 N. GrUnwald IX ON INDEPENDENT VERTICES AND EDGES OF A GRAPH 291 I. Gutman THE OUTERTHICKNESS &OUTERCOARSENESS OF GRAPHS 297 I. THE COMPLETE GRAPH &THE n-CUBE R.K. Guy I R.J. Nowakowski ON SOME GRAPHIC ASPECTS OF ADDITION THEOREMS 311 Y.O. Hamidoune ON THE CIRCUMFERENCE OF REGULAR POLYHEDRAL GRAPHS 319 J. Harant I H. Walther LONGEST CYCLES IN CIRCULANT GRAPHS 331 W. Harnau I D. Jordan SPANNING TREES OF THE COMPLETE BIPARTITE GRAPH 339 N. Hartsfield I J.S. Werth A COMBINATORIAL THEOREM WHICH IS RELATED TO THE INVARIANCE OF 347 THE SEPARATING SET FOR THE PLANE E. Harzheim ON CERTAIN TREES IN HYPERCUBES 353 I. Havel EXTENDING HALL1S THEOREM 359 A.J.W. Hilton I P.O. Johnson Jr. ON THE COUPLING CONDITION AND HAMIL TONICITY 373 C. Hoede I H.J. Smit TRANSVERSALS AND MATROIDS 381 P. Hor&k CLASSIFICATION AND CONSTRUCTION OF GEODETIC BLOCK 391 WITH DIAMETER TWO M. Jingzhong GRAPH DISTANCES AND SIMILARITY 397 F. Kaden WITT RINGS AND SEMI ORDERINGS OF PLANAR TERNARY RINGS 405 F.B. Kalhoff LINEAR INEQUALITIES DESCRIBING THE CLASS OF INTERSECTING SPERNER 413 FAMILIES OF SUBSETS. I G.O.H. Katona I G. Schild INTEGRAL DRAWINGS OF THE COMPLETE GRAPH K6 421 A. Kemnitz x ON CERTAIN BINOMIAL SUMS 431 W. Klotz COLOURING OF SPIDER GRAPHS 435 M. Koebe A LAS-VERGNAS TYPE THEOREM FOR TREES 443 I. Krasikov / Y. Roditty QUICK GOSSIPING BY MULTI-TELEGRAPHS 451 R. Labahn / I. Warnke NUMBERINGS ON GRAPHS HAVING SMALL EDGE WEIGHTS 459 R. Lang ON VERTEXMINIMAL GRAPHS WITH RADIUS r AND CONNECTIVITY 2m 471 G. Lassmann EMBEDDING SCHEMES AND THE JORDAN CURVE THEOREM 479 C.H.C. Little / A. Vince SUBGRAPH PACKING - A SURVEY 491 M. Loebl / S. Poljak ON THE RADIUS OF RANDOM SUBGRAPHS OF THE n-CUBE 505 K. Mahrhold / K. Weber A RESULT IN COMBINATORIAL MATROID THEORY 513 D. Marcu ON GRAPHS EMBEQDABLE WITH SHORT FACES 519 R. Nedela / MSkoviera ON CYCLIC REPRESENTATIONS OF TRIPLES BY PAIRS 531 J. Novak ON THE STEINER PERIPHERY AND STEINER ECCENTRICITY OF A GRAPH 541 O.R. Oellermann / H.C. Swart CYCLES CONTAINING THREE CONSECUTIVE EDGES 549 IN 2k-EDGE-CONNECTED GRAPHS H. Okamura GRAPH DISTANCE AND EUCLIDEAN DISTANCE ON THE GRID 555 J. Pach / R. Pollack / J. Spencer ABOUT THE COMPLEXITY OF SOME HOMOMORPHISM PROBLEMS ON GRAPHS 561 A. Quilliot ON AN INEQUALITY OF SPERNER 569 A. Rausche COUNTING PERFECT MATCHINGS IN LATTICE GRAPHS 577 H. Sachs XI GENYS -vMINIMAL EDGES AND KURATOWSKI SUBGRAPHS OF A GRAPH 585 J. Sir~n FROM TREE PATH-FACTORS AND DOUBLY EXPONENTIAL SEQUENCES 595 TO A BINOMIAL INEQUALITY Z. Skupien A CHARACTERIZATION OF POINT-COLOUR-SYMMETRIC HYPERGRAPHS 605 S. Sze-Chin A LINEAR ALGORITHM FOR THE PATHWIDTH OF TREES 613 P. Scheffler THE TIME TRAVELLING PROBLEM 621 G.
Load more

Recommended publications
  • Empire Maps on Surfaces Arxiv:1106.4235V1 [Math.GT]
    University of Durham Final year project Empire Maps on Surfaces An exploration into colouring empire maps on the sphere and higher genus surfaces Author: Supervisor: Caspar de Haes Dr Vitaliy Kurlin D C 0 7 8 0 E 6 9 5 10 0 0 4 11 B 1' 3' F 3 5' 12 12' 0 7' 0 2 10' 2 A 13 9' A 1 1 8' 11' 0 0 0' 11 6' 4 4' 2' F 12 3 B 0 0 9 6 5 10 C E 0 7 8 0 arXiv:1106.4235v1 [math.GT] 21 Jun 2011 D April 28, 2011 Abstract This report is an introduction to mathematical map colouring and the problems posed by Heawood in his paper of 1890. There will be a brief discussion of the Map Colour Theorem; then we will move towards investigating empire maps in the plane and the recent contri- butions by Wessel. Finally we will conclude with a discussion of all known results for empire maps on higher genus surfaces and prove Heawoods Empire Conjecture in a previously unknown case. Contents 1 Introduction 3 1.1 Overview of the Problem . 3 1.2 History of the Problem . 3 1.3 Chapter Plan . 5 2 Graphs 6 2.1 Terminology and Notation . 6 2.2 Complete Graphs . 8 3 Surfaces 9 3.1 Surfaces and Embeddings . 9 3.2 Euler Characteristic . 10 3.3 Orientability . 11 3.4 Classification of surfaces . 11 4 Map Colouring 14 4.1 Maps and Colouring . 14 4.2 Dual Graphs . 15 4.3 Colouring Graphs .
    [Show full text]
  • The Nonorientable Genus of Complete Tripartite Graphs
    The nonorientable genus of complete tripartite graphs M. N. Ellingham∗ Department of Mathematics, 1326 Stevenson Center Vanderbilt University, Nashville, TN 37240, U. S. A. [email protected] Chris Stephensy Department of Mathematics, 1326 Stevenson Center Vanderbilt University, Nashville, TN 37240, U. S. A. [email protected] Xiaoya Zhaz Department of Mathematical Sciences Middle Tennessee State University, Murfreesboro, TN 37132, U.S.A. [email protected] October 6, 2003 Abstract In 1976, Stahl and White conjectured that the nonorientable genus of Kl;m;n, where l m (l 2)(m+n 2) ≥ ≥ n, is − − . The authors recently showed that the graphs K3;3;3 , K4;4;1, and K4;4;3 2 ¡ are counterexamples to this conjecture. Here we prove that apart from these three exceptions, the conjecture is true. In the course of the paper we introduce a construction called a transition graph, which is closely related to voltage graphs. 1 Introduction In this paper surfaces are compact 2-manifolds without boundary. The orientable surface of genus h, denoted S , is the sphere with h handles added, where h 0. The nonorientable surface of genus h ≥ k, denoted N , is the sphere with k crosscaps added, where k 1. A graph is said to be embeddable k ≥ on a surface if it can be drawn on that surface in such a way that no two edges cross. Such a drawing ∗Supported by NSF Grants DMS-0070613 and DMS-0215442 ySupported by NSF Grant DMS-0070613 and Vanderbilt University's College of Arts and Sciences Summer Re- search Award zSupported by NSF Grant DMS-0070430 1 is referred to as an embedding.
    [Show full text]
  • Coloring Discrete Manifolds
    COLORING DISCRETE MANIFOLDS OLIVER KNILL Abstract. Discrete d-manifolds are classes of finite simple graphs which can triangulate classical manifolds but which are defined entirely within graph theory. We show that the chromatic number X(G) of a discrete d-manifold G satisfies d + 1 ≤ X(G) ≤ 2(d + 1). From the general identity X(A + B) = X(A) + X(B) for the join A+B of two finite simple graphs, it follows that there are (2k)-spheres with chromatic number X = 3k+1 and (2k − 1)-spheres with chromatic number X = 3k. Examples of 2-manifolds with X(G) = 5 have been known since the pioneering work of Fisk. Current data support the that an upper bound X(G) ≤ d3(d+1)=2e could hold for all d-manifolds G, generalizing a conjecture of Albertson-Stromquist [1], stating X(G) ≤ 5 for all 2-manifolds. For a d-manifold, Fisk has introduced the (d − 2)-variety O(G). This graph O(G) has maximal simplices of dimension (d − 2) and correspond to complete complete subgraphs Kd−1 of G for which the dual circle has odd cardinality. In general, O(G) is a union of (d − 2)-manifolds. We note that if O(S(x)) is either empty or a (d − 3)-sphere for all x then O(G) is a (d − 2)-manifold or empty. The knot O(G) is already interesting for 3-manifolds G because Fisk has demonstrated that every possible knot can appear as O(G) for some 3-manifold. For 4-manifolds G especially, the Fisk variety O(G) is a 2-manifold in G as long as all O(S(x)) are either empty or a knot in every unit 3-sphere S(x).
    [Show full text]
  • Embeddings of Graphs
    View metadata, citation and similar papers at core.ac.uk brought to you by CORE provided by Elsevier - Publisher Connector Discrete Mathematics 124 (1994) 217-228 217 North-Holland Embeddings of graphs Carsten Thomassen Mathematisk Institut, Danmarks Tekniske Hojskoie. Bygning 303, DK-Lyngby. Denmark Received 2 June 1990 Abstract We survey some recent results on graphs embedded in higher surfaces or general topological spaces. 1. Introduction A graph G is embedded in the topological space X if G is represented in X such that the vertices of G are distinct elements in X and an edge in G is a simple arc connecting its two ends such that no two edges intersect except possibly at a common end. Graph embeddings in a broad sense have existed since ancient time. Pretty tilings of the plane have been produced for aestetic or religious reasons (see e.g. [7]). The characterization of the Platonic solids may be regarded as a result on tilings of the sphere. The study of graph embeddings in a more restricted sense began with the 1890 conjecture of Heawood [S] that the complete graph K, can be embedded in the orientable surface S, provided Euler’s formula is not violated. That is, g >&(n - 3)(n -4). Much work on graph embeddings has been inspired by this conjecture the proof of which was not completed until 1968. A complete proof can be found in Ringel’s book [12]. Graph embedding problems also arise in the real world, for example in connection with the design of printed circuits. Also, algorithms involving graphs may be very sensitive to the way in which the graphs are represented.
    [Show full text]
  • Package 'Igraph'
    Package ‘igraph’ February 28, 2013 Version 0.6.5-1 Date 2013-02-27 Title Network analysis and visualization Author See AUTHORS file. Maintainer Gabor Csardi <[email protected]> Description Routines for simple graphs and network analysis. igraph can handle large graphs very well and provides functions for generating random and regular graphs, graph visualization,centrality indices and much more. Depends stats Imports Matrix Suggests igraphdata, stats4, rgl, tcltk, graph, Matrix, ape, XML,jpeg, png License GPL (>= 2) URL http://igraph.sourceforge.net SystemRequirements gmp, libxml2 NeedsCompilation yes Repository CRAN Date/Publication 2013-02-28 07:57:40 R topics documented: igraph-package . .5 aging.prefatt.game . .8 alpha.centrality . 10 arpack . 11 articulation.points . 15 as.directed . 16 1 2 R topics documented: as.igraph . 18 assortativity . 19 attributes . 21 autocurve.edges . 23 barabasi.game . 24 betweenness . 26 biconnected.components . 28 bipartite.mapping . 29 bipartite.projection . 31 bonpow . 32 canonical.permutation . 34 centralization . 36 cliques . 39 closeness . 40 clusters . 42 cocitation . 43 cohesive.blocks . 44 Combining attributes . 48 communities . 51 community.to.membership . 55 compare.communities . 56 components . 57 constraint . 58 contract.vertices . 59 conversion . 60 conversion between igraph and graphNEL graphs . 62 convex.hull . 63 decompose.graph . 64 degree . 65 degree.sequence.game . 66 dendPlot . 67 dendPlot.communities . 68 dendPlot.igraphHRG . 70 diameter . 72 dominator.tree . 73 Drawing graphs . 74 dyad.census . 80 eccentricity . 81 edge.betweenness.community . 82 edge.connectivity . 84 erdos.renyi.game . 86 evcent . 87 fastgreedy.community . 89 forest.fire.game . 90 get.adjlist . 92 get.edge.ids . 93 get.incidence . 94 get.stochastic .
    [Show full text]
  • THIRTEEN COLORFUL VARIATIONS on GUTHRIE's FOUR-COLOR CONJECTURE Dedicated to the Memory of Oystein Ore THOMAS L
    THIRTEEN COLORFUL VARIATIONS ON GUTHRIE'S FOUR-COLOR CONJECTURE Dedicated to the memory of Oystein Ore THOMAS L. SAATY, Universityof Pennsylvania INTRODUCTION After careful analysis of information regarding the origins of the four-color conjecture, Kenneth 0. May [1] concludes that: "It was not the culmination of a series of individual efforts that flashed across the mind of Francis Guthrie while coloring a map of England ... his brother communicated the conjecture, but not the attempted proof to De Morgan in October, 1852." His information also reveals that De Morgan gave it some thought and com- municated it to his students and to other mathematicians, giving credit to Guthrie. In 1878 the first printed reference to the conjecture, by Cayley, appeared in the Proceedings of the London Mathematical Society. He wrote asking whether the conjecture had been proved. This launched its colorful career involving 4 number of equivalent variations, conjectures, and false proofs, which to this day, leave the question of sufficiency wide open in spite of the fact that it is known to hold for a map of no more than 39 countries. Our purpose here is to present a short, condensed version (with definitions) of most equivalent forms of the conjecture. In each case references are given to the original or related paper. For the sake of brevity, proofs are omitted. The reader will find a rich source of information regarding the problem in Ore's famous book [1], "The Four-Color Problem". A number of conjectures given here are not in any of the books published so far.
    [Show full text]
  • A Practical 4-Coloring Method of Planar Graphs
    A Practical 4-coloring Method of Planar Graphs Mingshen Wu1 and Weihu Hong2 1Department of Math, Stat, and Computer Science, University of Wisconsin-Stout, Menomonie, WI 54751 2Department of Mathematics, Clayton State University, Morrow, GA, 30260 ABSTRACT An interesting coloring formula was conjectured by The existence of a 4-coloring for every finite loopless planar Heawood in 1890 [7]: For a given genus g > 0, the minimum graph (LPG) has been proven even though there are still number of colors necessary to color all graphs drawn on the some remaining discussions on the proof(s). How to design surface of that genus is given by a proper 4-coloring for a LPG? The purpose of this note is 7++ 1 48g to introduce a practical 4-coloring method that may provide γ ()g = . 2 a proper 4-coloring for a map or a LPG that users may be interested in. The coloring process may be programmable with an interactive user-interface to get a fast proper For example, with genus g =1, it is a doughnut-shaped coloring. object. γ (1)= 7 means the chromatic number is seven. Picture 2 shows that the seven regions (with seven different Key words: 4-coloring, two-color subgraph, triangulation colors) can be topologically put on a torus such that the seven regions are mutually adjacent each other on the torus. 1 Brief historical review So, it clearly requires at least seven colors to be able to give In 1852, Francis Guthrie, a college student, noticed that only a proper coloring of maps on the torus.
    [Show full text]
  • On Genus G Orientable Crossing Numbers of Small Complete Graphs
    On Genus g Orientable Crossing Numbers of Small Complete Graphs Yoonah Lee Abstract The current state of knowledge of genus g orientable crossing num- bers of complete graphs through K11 is reviewed. It is shown that cr3(K10) = 3; cr3(K11) ≤ 14; and cr4(K11) = 4: It is established with the aid of an algorithm that there are precisely two non-isomorphic embeddings of K9 with a hexagon with all its vertices distinct on a surface of genus 3. Introduction Given a surface S and a graph G, a drawing of G has edges with two distinct vertices as endpoints and no vertices that share three edges [1]. The crossing number of G on S, denoted crS(G), is the minimum number of crossings in any drawing of G on S. Good drawings are considered to have three conditions: no arc connecting two nodes intersects itself, two arcs have at most one point of intersection, and two arcs with the same node have no other intersecting points. Optimal drawings have the minimum number of crossings of G on S [2]. It can be shown that optimal drawings are good drawings. The crossing numbers of complete graphs Kn on orientable surfaces Sg of positive genus has been an object of interest since Heawood's map-coloring conjecture in 1890 [3]. Despite significant progress, the values of the crossing number for even rather small complete graphs on these surfaces has been arXiv:1902.02759v1 [math.CO] 7 Feb 2019 unclear. But when Kn−1 can be embedded in Sg; adding a vertex to the embedding and connecting it to each of the n − 1 vertices can in some cases produce a drawing with the lowest possible number of crossings, and in other cases a different method is required.
    [Show full text]
  • Package 'Igraph0'
    Package ‘igraph0’ February 15, 2013 Version 0.5.6-2 Date 2013-01-05 Title Network analysis and visualization, old, deprecated package. Author See AUTHORS file. Maintainer Gabor Csardi <[email protected]> Description Network analysis package, old, deprecated version. ’igraph0’ is the old version of the igraph package, kept alive temporarily, for compatibility reasons. In this package,vertices and edges are in- dexed from zero, whereas in ’igraph’,starting from version 0.6, they are in- dexed from one. Please do not use this package for new projects. Depends stats Suggests stats4, rgl, tcltk, RSQLite, digest, graph, Matrix License GPL (>= 2) URL http://igraph.sourceforge.net SystemRequirements gmp, libxml2 Repository CRAN Date/Publication 2013-01-09 19:39:41 NeedsCompilation yes R topics documented: igraph-package . .4 aging.prefatt.game . .6 alpha.centrality . .8 arpack . 10 articulation.points . 13 1 2 R topics documented: as.directed . 14 attributes . 16 barabasi.game . 18 betweenness . 20 biconnected.components . 22 bipartite.projection . 23 bonpow . 24 canonical.permutation . 26 cliques . 28 closeness . 30 clusters . 31 cocitation . 32 cohesive.blocks . 33 communities . 36 components . 37 constraint . 38 conversion . 39 conversion between igraph and graphNEL graphs . 40 decompose.graph . 41 degree . 42 degree.sequence.game . 43 diameter . 45 Drawing graphs . 46 dyad.census . 52 edge.betweenness.community . 53 edge.connectivity . 55 erdos.renyi.game . 57 evcent . 58 fastgreedy.community . 59 forest.fire.game . 61 get.adjlist . 62 get.incidence . 63 girth . 65 graph-isomorphism . 66 graph-motifs . 69 graph-operators . 71 graph.adjacency . 72 graph.automorphisms . 75 graph.bipartite . 76 graph.constructors . 77 graph.coreness .
    [Show full text]
  • Coloring Discrete Manifolds
    COLORING DISCRETE MANIFOLDS OLIVER KNILL Abstract. Discrete d-manifolds are classes of finite simple graphs which can triangulate classical manifolds but which are defined entirely within graph theory. We show that the chromatic number X(G) of a discrete d-manifold G satisfies d + 1 ≤ X(G) ≤ 2(d + 1). From the general identity X(A + B) = X(A) + X(B) for the join A+B of two finite simple graphs, it follows that there are (2k)-spheres with chromatic number X = 3k+1 and (2k − 1)-spheres with chromatic number X = 3k. Examples of 2-manifolds with X(G) = 5 have been known since the pioneering work of Fisk. Current data support the that an upper bound X(G) ≤ d3(d+1)=2e could hold for all d-manifolds G, generalizing a conjecture of Albertson-Stromquist [1], stating X(G) ≤ 5 for all 2-manifolds. For a d-manifold, Fisk has introduced the (d − 2)-variety O(G). This graph O(G) has maximal simplices of dimension (d − 2) and correspond to complete complete subgraphs Kd−1 of G for which the dual circle has odd cardinality. In general, O(G) is a union of (d − 2)-manifolds. We note that if O(S(x)) is either empty or a (d − 3)-sphere for all x then O(G) is a (d − 2)-manifold or empty. The knot O(G) is already interesting for 3-manifolds G because Fisk has demonstrated that every possible knot can appear as O(G) for some 3-manifold. For 4-manifolds G especially, the Fisk variety O(G) is a 2-manifold in G as long as all O(S(x)) are either empty or a knot in every unit 3-sphere S(x).
    [Show full text]
  • Xerox University Microfilms 300 North Zeeb Road Ann Arbor, Michigan 4B106 I I I I 75-26,683 WANG, Chin San, 1939- IMBEDDING GRAPHS in the PROJECTIVE PLANE
    INFORMATION TO USERS This material was produced from a microfilm copy of the original document. While the most advanced technological means to photograph and reproduce this document have been used, the quality is heavily dependent upon the quality of the original submitted. The following explanation of techniques is provided to help you understand markings or patterns which may appear on this reproduction. 1.The sign or "target" for pages apparently lacking from the document photographed is "Missing Page(s)". If it was possible to obtain the missing page{s) or section, they are spliced into the film along with adjacent pages. This may have necessitated cutting thru an image and duplicating adjacent pages to insure you complete continuity. 2. When an image on the film is obliterated with a large round black mark, it is an indication that the photographer suspected that the copy may have moved during exposure and thus cause a blurred image. You will find a good image of the page in the adjacent frame. 3. When a map, drawing or chart, etc., was part of the material being photographed the photographer followed a definite method in "sectioning" the material. It is customary to begin photoing at the upper left hand corner of a large sheet and to continue photoing from left to right in equal sections with a small overlap. If necessary, sectioning is continued again — beginning below the first row and continuing on until complete. 4. The majority of users indicate that the textual content is of greatest value, however, a somewhat higher quality reproduction could be made from "photographs" if essential to the understanding of the dissertation.
    [Show full text]
  • Solution of the Heawood Map-Coloring Problem--Case 8
    JOURNAL OF COMBINATORIAL THEORY 7, 353-363 (1969) Solution of the Heawood Map-Coloring Problem--Case 8 GERHARD RINGEL AND J. W. T. YOUNGS* Free University of Berlin, Berlin, Germany, and University of California, Santa Cruz, California 95060 Received March 11, 1969 ABSTRACT This paper gives a proof of the fact that the chromatic number of an orientable surface of genus p is equal to the integral part of (7 + a/1 + 48p)/2 whenever the latter s congruent to 8 modulo 12. 1. INTRODUCTION The Heawood conjecture states that if S~ is a closed orientable surface of genus p > 0, then x(S~), the chromatic number of S~, is equal to H(p), the Heawood number of S~, defined as [ 7+'C1 +48p H(?) 2 ]" (1) The Heawood theorem is that x(S~) <<, H(p) if p > 0. (2) It is essential that the reader consult [3] as a general reference for terms and notations which may be unfamiliar. The Heawood conjecture withstood attack for 78 years but was finally confirmed completely, early in 1968. As usual the argument is in dual form. If K is a graph without loops and multiple edges, then y(K), the genus of K is the smallest integer p such that K can be imbedded in S~. If I(n) = I (n-3)(n12 --4) I for n >~3, (3) then it has been shown that v(K,) >/I(n), (4) * Both authors received partial support from the National Science Foundation. 353 582/7]4-5 354 RINGEL AND YOUNGS where K, is the complete graph with n vertices.
    [Show full text]