DOCSLIB.ORG

Flower-Snarks Are Flow-Critical

Total Page：16

File Type：pdf, Size：1020Kb

Download full-text PDF Read full-text
Flower-Snarks Are Flow-Critical Flower-Snarks are Flow-Critical Cˆandida Nunes da Silva 1,3 DComp – CCTS ufscar Sorocaba, sp, Brazil Cl´audio L. Lucchesi 2,4 Faculty of Computing facom-ufms Campo Grande, ms, Brazil Abstract In this paper we show that all flower-snarks are 4-flow-critical graphs. Keywords: nowhere-zero k-flows, Tutte’s Conjectures, flower-snarks, 3-edge-colouring 1 Snarks and Flower-Snarks A snark is a cubic graph that does not admit a 3-edge-colouring, which is cyclically 4-edge-connected and has girth at least five. The Petersen graph 1 Support by fapesp and capes 2 Support by cnpq 3 Email: [email protected] 4 Email:[email protected] was the first snark discovered and, for several decades later, very few other snarks were found. This apparent difficulty in finding such graphs inspired Descartes to name them snarks after the Lewis Carroll poem ”The Hunting of the Snark”. Good accounts on the delightful history behind snarks hunt and their relevance in Graph Theory can be found in [2,7,1]. In 1975, Isaacs [5] showed that there were infinite families of snarks, one of such being the flower- snarks. A flower-snark Jn is a graph on 4n vertices, for n ≥ 5 and odd, whose vertices are labelled Vi = {wi, xi,yi, zi}, for 1 ≤ i ≤ n and whose edges can be partitioned into n star graphs and two cycles as we will next describe. Each quadruple Vi of vertices induce a star graph with wi as its center. Ver- tices zi induce an odd cycle (z1, z2,...,zn, z1). Vertices xi and yi induce an even cycle (x1, x2,...,xn,y1,y2,...,yn, x1). Figure 1 depicts several different drawings of flower-snark J5 on 20 vertices. The drawing of Figure 1(a) is the original drawing presented by Isaacs to represent flower-snarks. It emphasizes the flower-shape of such graphs as well as the crossing of edges (x1,yn) and (xn,y1). A more symmetric drawing of flower-snarks can be obtained from the original drawing by switching the positions of vertices xi and yi for even i. Figure 1(b) depicts the symmetric drawing of J5 thus obtained. We present a third representation of flower-snarks as a sequential string of stars induced by vertices Vi, each of which linked to Vi+1 by a set of three linking edges Ei = {(zi, zi+1), (xi, xi+1), (yi,yi+1)}, for 1 ≤ i ≤ n − 1 and closed by linking edges En = {(z1, zn), (x1,yn), (xn,y1)}. Figure 1(c) depicts a string drawing of J5. The symmetric drawing of a flower-snark is helpful in identifying its auto- morphisms. Clearly, there is an automorphism mapping every xi vertex into yi and vice-versa. Also, these graphs have rotational symmetry, i. e., an au- tomorphism mapping every zi into zi+1, wi into wi+1, xi into yi+1 and yi into 5 xi+1 . An appropriate combination of these two automorphisms can be used to map every vertex zi into zj, every vertex wi into wj and every vertex xi or yi into xj or yj. Therefore, there are essentially just four different types of edges in any flower-snark, which are (i) edges zizi+1, which are called internal edges; (ii) edges ziwi, which are called spoke edges; (iii) edges wixi and wiyi, which are called fork edges; (iv) edges xixi+1, yiyi+1, x1yn and xny1, which are called external edges. 5 These sums should be taken modulo n x3 y3 x3 y3 w3 w3 x4 y4 y2 x2 z z3 w4 3 w4 z4 y4 z4 x4 w2 w2 x2 z2 y2 z2 z5 z5 z1 z1 w5 w5 w1 x5 w1 x5 y1 y1 x1 y5 x1 y5 (a) Original drawing of flower-snark J5 (b) Symmetric drawing of flower-snark J5 x1 x2 x3 x4 x5 y1 y2 y3 y4 y5 w1 w2 w3 w4 w5 z1 z2 z3 z4 z5 (c) Drawing of flower-snark J5 as a string of star graphs Fig. 1. Several drawings of flower-snark J5 2 Flower-Snarks are Flow-Critical Let k > 1 be an integer, G =(V, E) be a graph and (D,ϕ) a pair of functions such that D defines orientations to the edges of E and ϕ associates to each edge in E a non-zero integer weight in the set {1, 2,...,k − 1}. The pair (D,ϕ) is a (nowhere-zero) k-flow of G if, for every vertex v ∈ V , the sum of the weights of all edges leaving v equal the sum of all edges entering v. Tutte [6] defined the concept of k-flows with the purpose of generalizing to non-planar graphs several problems regarding colourings of planar graphs. A famous theorem of Tutte (see [1, Theorem 21.11]), stated below, is essential to prove that flower-snarks are 4-flow-critical. Theorem 2.1 (Tutte) A cubic graph admits a 4-flow if and only if it admits a 3-edge-colouring. A graph G is k-colour-critical if it does not admit a k-vertex-colouring but every proper subgraph of G admits a k-vertex-colouring. Dirac [4] defined the concept of critical graphs for the vertex-colouring problem and discovered several properties of such graphs. Likewise, in a previous paper [3] we defined the concept of (edge-)k-flow-critical graphs. A graph G is k-flow-critical if it does not admit a k-flow but the graph G/e obtained from G by the contrac- tion of an arbitrary edge e does admit a k-flow. Moreover, as stated in [3, Theorem 3.1], a k-flow-critical graph can be equivalently defined as a graph G that does not admit a k-flow but the graph G − e obtained from G by the removal of an arbitrary edge e does admit a k-flow. We will show in this section that every flower-snark is 4-flow-critical. It follows from the definition of snarks and Theorem 2.1, that those do not admit a 4-flow. Therefore, it suffices to show that if we remove any edge of a flower- snark, the resulting graph admits a 4-flow. Let e = (u, v) be any edge of a flower-snark Jn. As Jn is cubic, Jn − e is a subdivision of a cubic graph, with u and v being its only vertices of degree two. Let He be the cubic graph obtained from Jn −e by the contraction of two edges: one incident with u and the other with v. We call He the underlying cubic graph of Jn − e. It can be trivially shown that He will have a 4-flow if and only if Jn − e has a 4-flow. Therefore, it suffices to show that He admit a 3-edge-colouring of its edges, for every edge e of Jn. Let Ja,b, for 1 ≤ a < b ≤ n − 1, be the subgraph of Jn induced by the edges in Ei for a ≤ i ≤ b and in G[Vi] for a<i<b. We say Ja,b has a clock- wise rotated 3-colouring if it has a 3-edge-colouring such that the edges in Ea receive a different colour each and those colours appear clockwise rotated in Eb, i.e., the pairs of edges {(za, za+1), (xb, xb+1)}, {(xa, xa+1), (yb,yb+1)} and {(ya,ya+1), (zb, zb+1)} receive one different colour each. Figure 2(a) illustrates a clockwise rotated 3-colouring of Ja,a+1, for 1 ≤ a ≤ n − 2. The colours assigned to the edges are represented by three different patterns of line draw- ings. Similarly, we say Ja,b has a counter-clockwise rotated 3-colouring if it has a 3-edge-colouring such that the edges in Ea receive a different colour each and those colours appear counter-clockwise rotated in Eb, i.e., the pairs of edges {(za, za+1), (yb,yb+1)}, {(xa, xa+1), (zb, zb+1)} and {(ya,ya+1), (xb, xb+1)} receive one different colour each. Figure 2(b) illustrates a counter-clockwise rotated 3-colouring of Ja,a+1, for 1 ≤ a ≤ n − 2. The simple observation of the 3-colourings depicted on Figure 2 allow us to state the following lemma: Lemma 2.2 Every Ja,a+1 for 1 ≤ a ≤ n − 2 has both a clockwise and a xa xa+1 xa+2 xa xa+1 xa+2 ya ya+1 ya+2 ya ya+1 ya+2 wa+1 wa+1 za za+1 za+2 za za+1 za+2 Ea Ea+1 Ea Ea+1 (a) Clockwise 3-colouring of Ja,a+1 (b) Counter-clockwise 3-colouring of Ja,a+1 Fig. 2. Clockwise and counter-clockwise 3-colourings of Ja,a+1 counter-clockwise rotated 3-colouring. Following the same idea, we say Ja,b has a neutral 3-colouring if it has a 3-edge-colouring such that the edges in Ea receive a different colour each and those colours appear replicated in Eb, i.e., the pairs of edges {(za, za+1), (zb, zb+1)}, {(xa, xa+1), (xb, xb+1)} and {(ya,ya+1), (yb,yb+1)} receive one different colour each. In Figure 3 we present a neutral 3-colouring of Ja,a+2, for 1 ≤ a ≤ n − 3, and of Ja,a+3, for 1 ≤ a ≤ n − 4. The neutral 3-colouring of Figure 3(a) was obtained by combining a clockwise rotated 3-colouring of Ja,a+1 and a counter-clockwise rotated 3-colouring of Ja+1,a+2 whose colours coincide in Ea+1.
Load more

Recommended publications
  • 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).
    [Show full text]
  • On the Cycle Double Cover Problem
    On The Cycle Double Cover Problem Ali Ghassâb1 Dedicated to Prof. E.S. Mahmoodian Abstract In this paper, for each graph , a free edge set is defined. To study the existence of cycle double cover, the naïve cycle double cover of have been defined and studied. In the main theorem, the paper, based on the Kuratowski minor properties, presents a condition to guarantee the existence of a naïve cycle double cover for couple . As a result, the cycle double cover conjecture has been concluded. Moreover, Goddyn’s conjecture - asserting if is a cycle in bridgeless graph , there is a cycle double cover of containing - will have been proved. 1 Ph.D. student at Sharif University of Technology e-mail: [email protected] Faculty of Math, Sharif University of Technology, Tehran, Iran 1 Cycle Double Cover: History, Trends, Advantages A cycle double cover of a graph is a collection of its cycles covering each edge of the graph exactly twice. G. Szekeres in 1973 and, independently, P. Seymour in 1979 conjectured: Conjecture (cycle double cover). Every bridgeless graph has a cycle double cover. Yielded next data are just a glimpse review of the history, trend, and advantages of the research. There are three extremely helpful references: F. Jaeger’s survey article as the oldest one, and M. Chan’s survey article as the newest one. Moreover, C.Q. Zhang’s book as a complete reference illustrating the relative problems and rather new researches on the conjecture. A number of attacks, to prove the conjecture, have been happened. Some of them have built new approaches and trends to study.
    [Show full text]
  • An Exploration of Late Twentieth and Twenty-First Century Clarinet Repertoire
    Southern Illinois University Carbondale OpenSIUC Research Papers Graduate School Spring 2021 An Exploration of Late Twentieth and Twenty-First Century Clarinet Repertoire Grace Talaski [email protected] Follow this and additional works at: https://opensiuc.lib.siu.edu/gs_rp Recommended Citation Talaski, Grace. "An Exploration of Late Twentieth and Twenty-First Century Clarinet Repertoire." (Spring 2021). This Article is brought to you for free and open access by the Graduate School at OpenSIUC. It has been accepted for inclusion in Research Papers by an authorized administrator of OpenSIUC. For more information, please contact [email protected]. AN EXPLORATION OF LATE TWENTIETH AND TWENTY-FIRST CENTURY CLARINET REPERTOIRE by Grace Talaski B.A., Albion College, 2017 A Research Paper Submitted in Partial Fulfillment of the Requirements for the Master of Music School of Music in the Graduate School Southern Illinois University Carbondale April 2, 2021 Copyright by Grace Talaski, 2021 All Rights Reserved RESEARCH PAPER APPROVAL AN EXPLORATION OF LATE TWENTIETH AND TWENTY-FIRST CENTURY CLARINET REPERTOIRE by Grace Talaski A Research Paper Submitted in Partial Fulfillment of the Requirements for the Degree of Master of Music in the field of Music Approved by: Dr. Eric Mandat, Chair Dr. Christopher Walczak Dr. Douglas Worthen Graduate School Southern Illinois University Carbondale April 2, 2021 AN ABSTRACT OF THE RESEARCH PAPER OF Grace Talaski, for the Master of Music degree in Performance, presented on April 2, 2021, at Southern Illinois University Carbondale. TITLE: AN EXPLORATION OF LATE TWENTIETH AND TWENTY-FIRST CENTURY CLARINET REPERTOIRE MAJOR PROFESSOR: Dr. Eric Mandat This is an extended program note discussing a selection of compositions featuring the clarinet from the mid-1980s through the present.
    [Show full text]
  • Graph Algorithms Graph Algorithms a Brief Introduction 3 References 高晓沨 ((( Xiaofeng Gao )))
    目录 1 Graph and Its Applications 2 Introduction to Graph Algorithms Graph Algorithms A Brief Introduction 3 References 高晓沨 ((( Xiaofeng Gao ))) Department of Computer Science Shanghai Jiao Tong Univ. 2015/5/7 Algorithm--Xiaofeng Gao 2 Konigsberg Once upon a time there was a city called Konigsberg in Prussia The capital of East Prussia until 1945 GRAPH AND ITS APPLICATIONS Definitions and Applications Centre of learning for centuries, being home to Goldbach, Hilbert, Kant … 2015/5/7 Algorithm--Xiaofeng Gao 3 2015/5/7 Algorithm--Xiaofeng Gao 4 Position of Konigsberg Seven Bridges Pregel river is passing through Konigsberg It separated the city into two mainland area and two islands. There are seven bridges connecting each area. 2015/5/7 Algorithm--Xiaofeng Gao 5 2015/5/7 Algorithm--Xiaofeng Gao 6 Seven Bridge Problem Euler’s Solution A Tour Question: Leonhard Euler Solved this Can we wander around the city, crossing problem in 1736 each bridge once and only once? Published the paper “The Seven Bridges of Konigsbery” Is there a solution? The first negative solution The beginning of Graph Theory 2015/5/7 Algorithm--Xiaofeng Gao 7 2015/5/7 Algorithm--Xiaofeng Gao 8 Representing a Graph More Examples Undirected Graph: Train Maps G=(V, E) V: vertex E: edges Directed Graph: G=(V, A) V: vertex A: arcs 2015/5/7 Algorithm--Xiaofeng Gao 9 2015/5/7 Algorithm--Xiaofeng Gao 10 More Examples (2) More Examples (3) Chemical Models 2015/5/7 Algorithm--Xiaofeng Gao 11 2015/5/7 Algorithm--Xiaofeng Gao 12 More Examples (4) More Examples (5) Family/Genealogy Tree Airline Traffic 2015/5/7 Algorithm--Xiaofeng Gao 13 2015/5/7 Algorithm--Xiaofeng Gao 14 Icosian Game Icosian Game In 1859, Sir William Rowan Hamilton Examples developed the Icosian Game.
    [Show full text]
  • SAT Approach for Decomposition Methods
    SAT Approach for Decomposition Methods DISSERTATION submitted in partial fulfillment of the requirements for the degree of Doktorin der Technischen Wissenschaften by M.Sc. Neha Lodha Registration Number 01428755 to the Faculty of Informatics at the TU Wien Advisor: Prof. Stefan Szeider Second advisor: Prof. Armin Biere The dissertation has been reviewed by: Daniel Le Berre Marijn J. H. Heule Vienna, 31st October, 2018 Neha Lodha Technische Universität Wien A-1040 Wien Karlsplatz 13 Tel. +43-1-58801-0 www.tuwien.ac.at Erklärung zur Verfassung der Arbeit M.Sc. Neha Lodha Favoritenstrasse 9, 1040 Wien Hiermit erkläre ich, dass ich diese Arbeit selbständig verfasst habe, dass ich die verwen- deten Quellen und Hilfsmittel vollständig angegeben habe und dass ich die Stellen der Arbeit – einschließlich Tabellen, Karten und Abbildungen –, die anderen Werken oder dem Internet im Wortlaut oder dem Sinn nach entnommen sind, auf jeden Fall unter Angabe der Quelle als Entlehnung kenntlich gemacht habe. Wien, 31. Oktober 2018 Neha Lodha iii Acknowledgements First and foremost, I would like to thank my advisor Prof. Stefan Szeider for guiding me through my journey as a Ph.D. student with his patience, constant motivation, and immense knowledge. His guidance helped me during the time of research and writing of this thesis. I could not have imagined having a better advisor and mentor. Next, I would like to thank my co-advisor Prof. Armin Biere, my reviewers, Prof. Daniel Le Berre and Dr. Marijn Heule, and my Ph.D. committee, Prof. Reinhard Pichler and Prof. Florian Zuleger, for their insightful comments, encouragement, and patience.
    [Show full text]
  • Snarks and Flow-Critical Graphs 1
    Snarks and Flow-Critical Graphs 1 CˆandidaNunes da Silva a Lissa Pesci a Cl´audioL. Lucchesi b a DComp – CCTS – ufscar – Sorocaba, sp, Brazil b Faculty of Computing – facom-ufms – Campo Grande, ms, Brazil Abstract It is well-known that a 2-edge-connected cubic graph has a 3-edge-colouring if and only if it has a 4-flow. Snarks are usually regarded to be, in some sense, the minimal cubic graphs without a 3-edge-colouring. We defined the notion of 4-flow-critical graphs as an alternative concept towards minimal graphs. It turns out that every snark has a 4-flow-critical snark as a minor. We verify, surprisingly, that less than 5% of the snarks with up to 28 vertices are 4-flow-critical. On the other hand, there are infinitely many 4-flow-critical snarks, as every flower-snark is 4-flow-critical. These observations give some insight into a new research approach regarding Tutte’s Flow Conjectures. Keywords: nowhere-zero k-flows, Tutte’s Flow Conjectures, 3-edge-colouring, flow-critical graphs. 1 Nowhere-Zero Flows Let k > 1 be an integer, let G be a graph, let D be an orientation of G and let ϕ be a weight function that associates to each edge of G a positive integer in the set {1, 2, . , k − 1}. The pair (D, ϕ) is a (nowhere-zero) k-flow of G 1 Support by fapesp, capes and cnpq if every vertex v of G is balanced, i. e., the sum of the weights of all edges leaving v equals the sum of the weights of all edges entering v.
    [Show full text]
  • Generation of Cubic Graphs and Snarks with Large Girth
    Generation of cubic graphs and snarks with large girth Gunnar Brinkmanna, Jan Goedgebeura,1 aDepartment of Applied Mathematics, Computer Science & Statistics Ghent University Krijgslaan 281-S9, 9000 Ghent, Belgium Abstract We describe two new algorithms for the generation of all non-isomorphic cubic graphs with girth at least k ≥ 5 which are very efficient for 5 ≤ k ≤ 7 and show how these algorithms can be efficiently restricted to generate snarks with girth at least k. Our implementation of these algorithms is more than 30, respectively 40 times faster than the previously fastest generator for cubic graphs with girth at least 6 and 7, respec- tively. Using these generators we have also generated all non-isomorphic snarks with girth at least 6 up to 38 vertices and show that there are no snarks with girth at least 7 up to 42 vertices. We present and analyse the new list of snarks with girth 6. Keywords: cubic graph, snark, girth, chromatic index, exhaustive generation 1. Introduction A cubic (or 3-regular) graph is a graph where every vertex has degree 3. Cubic graphs have interesting applications in chemistry as they can be used to represent molecules (where the vertices are e.g. carbon atoms such as in fullerenes [20]). Cubic graphs are also especially interesting in mathematics since for many open problems in graph theory it has been proven that cubic graphs are the smallest possible potential counterexamples, i.e. that if the conjecture is false, the smallest counterexample must be a cubic graph. For examples, see [5]. For most problems the possible counterexamples can be further restricted to the sub- class of cubic graphs which are not 3-edge-colourable.
    [Show full text]
  • Pebbling in Watkins Snark Graph
    International Journal of Research in Advent Technology, Vol.7, No.2, March 2019 E-ISSN: 2321-9637 Available online at www.ijrat.org Pebbling In Watkins Snark Graph Ms.Sreedevi S1, Dr.M.S Anilkumar2, Department of Mathematics, Mahatma Gandhi College, Thiruvananthapuram, Kerala1, 2 Email:[email protected],[email protected] Abstract- The pebbling theory is a study of a mathematical game that is played over a graph. In this game, a pebbling movement means removing two pebbles from a given vertex and adding one pebble to one of its neighbors and removing the other pebble from the game. The pebbling number of a graph G is defined a smallest positive integer required to add a pebble at any target vertex of the graph. It is denoted as . Every vertex of the graph is pebbled irrespective of the initial pattern of pebbles. Cubic graph is also called a 3- regular graph which is used in a real time scenario. In this paper, we have determined the pebbling number of Watkins Snark by constructing a Watkins Flower Snark of vertices, edges, cycles and disjoint sets which are present in the Watkins Snark. It is a connected graph in which bridgeless cubic index is equal to 4 with 75 edges and 50 vertices. Keywords - Graphs; pebbling number; Watkins Snark graph 1. INTRODUCTION 1.3 Solvability Throughout this paper, let denotes a simple connected graph. n and are the number Consider Peterson graph with pebbles on the vertices. of vertices and edges respectively in G and the diameter From the (Figure-1), one can move 2 pebbles among 3 of G is denoted as d.
    [Show full text]
  • On Hypohamiltonian Snarks and a Theorem of Fiorini
    On Hypohamiltonian Snarks and a Theorem of Fiorini Jan Goedgebeur ∗ Department of Applied Mathematics, Computer Science & Statistics, Ghent University, Krijgslaan 281-S9, 9000 Ghent, Belgium Carol T. Zamfirescu † Department of Applied Mathematics, Computer Science & Statistics, Ghent University, Krijgslaan 281-S9, 9000 Ghent, Belgium In memory of the first author’s little girl Ella. Received dd mmmm yyyy, accepted dd mmmmm yyyy, published online dd mmmmm yyyy Abstract We discuss an omission in the statement and proof of Fiorini’s 1983 theorem on hypo- hamiltonian snarks and present a version of this theorem which is more general in several ways. Using Fiorini’s erroneous result, Steffen showed that hypohamiltonian snarks exist for some n ≥ 10 and each even n ≥ 92. We rectify Steffen’s proof by providing a correct demonstration of a technical lemma on flower snarks, which might be of separate interest. We then strengthen Steffen’s theorem to the strongest possible form by determining all or- ders for which hypohamiltonian snarks exists. This also strengthens a result of M´aˇcajov´a and Skoviera.ˇ Finally, we verify a conjecture of Steffen on hypohamiltonian snarks up to 36 vertices. Keywords: hypohamiltonian, snark, irreducible snark, dot product Math. Subj. Class.: 05C10, 05C38, 05C45, 05C85. arXiv:1608.07164v1 [math.CO] 25 Aug 2016 1 Introduction A graph G is hypohamiltonian if G itself is non-hamiltonian, but for every vertex v in G, the graph G−v is hamiltonian. A snark shall be a cubic cyclically 4-edge-connected graph with chromatic index 4 (i.e. four colours are required in any proper edge-colouring) and girth at least 5.
    [Show full text]
  • Beatrice Ruini
    LE MATEMATICHE Vol. LXV (2010) – Fasc. I, pp. 3–21 doi: 10.4418/2010.65.1.1 SOME INFINITE CLASSES OF ASYMMETRIC NEARLY HAMILTONIAN SNARKS CARLA FIORI - BEATRICE RUINI We determine the full automorphism group of each member of three infinite families of connected cubic graphs which are snarks. A graph is said to be nearly hamiltonian if it has a cycle which contains all vertices but one. We prove, in particular, that for every possible order n ≥ 28 there exists a nearly hamiltonian snark of order n with trivial automorphism group. 1. Introduction Snarks are non-trivial connected cubic graphs which do not admit a 3-edge- coloring (a precise definition will be given below). The term snark owes its origin to Lewis Carroll’s famouse nonsense poem “The Hunting of the Snark”. It was introduced as a graph theoretical term by Gardner in [13] when snarks were thought to be very rare and unusual “creatures”. Tait initiated the study of snarks in 1880 when he proved that the Four Color Theorem is equivalent to the statement that no snark is planar. Asymmetric graphs are graphs pos- sessing a single graph automorphism -the identity- and for that reason they are also called identity graphs. Twenty-seven examples of asymmetric graphs are illustrated in [27]. Two of them are the snarks Sn8 and Sn9 of order 20 listed in [21] p. 276. Asymmetric graphs have been the subject of many studies, see, Entrato in redazione: 4 febbraio 2009 AMS 2000 Subject Classification: 05C15, 20B25. Keywords: full automorphism group, snark, nearly hamiltonian snark.
    [Show full text]
  • SNARKS Generation, Coverings and Colourings
    SNARKS Generation, coverings and colourings jonas hägglund Doctoral thesis Department of mathematics and mathematical statistics Umeå University April 2012 Doctoral dissertation Department of mathematics and mathematical statistics Umeå University SE-901 87 Umeå Sweden Copyright © 2012 Jonas Hägglund Doctoral thesis No. 53 ISBN: 978-91-7459-399-0 ISSN: 1102-8300 Printed by Print & Media Umeå 2012 To my family. ABSTRACT For a number of unsolved problems in graph theory such as the cycle double cover conjecture, Fulkerson’s conjecture and Tutte’s 5-flow conjecture it is sufficient to prove them for a family of graphs called snarks. Named after the mysterious creature in Lewis Carroll’s poem, a snark is a cyclically 4-edge connected 3-regular graph of girth at least 5 which cannot be properly edge coloured using three colours. Snarks and problems for which an edge minimal counterexample must be a snark are the central topics of this thesis. The first part of this thesis is intended as a short introduction to the area. The second part is an introduction to the appended papers and the third part consists of the four papers presented in a chronological order. In Paper I we study the strong cycle double cover conjecture and stable cycles for small snarks. We prove that if a bridgeless cubic graph G has a cycle of length at least jV(G)j - 9 then it also has a cycle double cover. Furthermore we show that there exist cyclically 5-edge connected snarks with stable cycles and that there exists an infinite family of snarks with stable cycles of length 24.
    [Show full text]
  • Graph Theory Graph Theory (II)
    J.A. Bondy U.S.R. Murty Graph Theory (II) ABC J.A. Bondy, PhD U.S.R. Murty, PhD Universite´ Claude-Bernard Lyon 1 Mathematics Faculty Domaine de Gerland University of Waterloo 50 Avenue Tony Garnier 200 University Avenue West 69366 Lyon Cedex 07 Waterloo, Ontario, Canada France N2L 3G1 Editorial Board S. Axler K.A. Ribet Mathematics Department Mathematics Department San Francisco State University University of California, Berkeley San Francisco, CA 94132 Berkeley, CA 94720-3840 USA USA Graduate Texts in Mathematics series ISSN: 0072-5285 ISBN: 978-1-84628-969-9 e-ISBN: 978-1-84628-970-5 DOI: 10.1007/978-1-84628-970-5 Library of Congress Control Number: 2007940370 Mathematics Subject Classification (2000): 05C; 68R10 °c J.A. Bondy & U.S.R. Murty 2008 Apart from any fair dealing for the purposes of research or private study, or criticism or review, as permitted under the Copyright, Designs and Patents Act 1988, this publication may only be reproduced, stored or trans- mitted, in any form or by any means, with the prior permission in writing of the publishers, or in the case of reprographic reproduction in accordance with the terms of licenses issued by the Copyright Licensing Agency. Enquiries concerning reproduction outside those terms should be sent to the publishers. The use of registered name, trademarks, etc. in this publication does not imply, even in the absence of a specific statement, that such names are exempt from the relevant laws and regulations and therefore free for general use. The publisher makes no representation, express or implied, with regard to the accuracy of the information contained in this book and cannot accept any legal responsibility or liability for any errors or omissions that may be made.
    [Show full text]