Hypohamiltonian Planar Cubic Graphs with Girth 5

A graph is called hypohamiltonian if it is not hamiltonian but becomes hamiltonian if any vertex is removed. Many hypohamiltonian planar cubic graphs have been found, starting with constructions of Thomassen in 1981. However, all the examples found until now had 4‐cycles. In this note we present the first examples of hypohamiltonian planar cubic graphs with cyclic connectivity 5, and thus girth 5. We show by computer search that the smallest members of this class are three graphs with 76 vertices.     

Generation of Cubic Graphs and Snarks with Large Girth

We describe two new algorithms for the generation of all non‐isomorphic cubic graphs with girth at least that are very efficient for and show how these algorithms can be 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 six and seven, respectively. Using these generators we have also generated all nonisomorphic snarks with girth at least six up to 38 vertices and show that there are no snarks with girth at least seven up to 42 vertices. We present and analyze the new list of snarks with girth 6.     

On Hypohamiltonian and Almost Hypohamiltonian Graphs

A graph G is almost hypohamiltonian if G is non‐hamiltonian, there exists a vertex w such that is non‐hamiltonian, and for any vertex the graph is hamiltonian. We prove the existence of an almost hypohamiltonian graph with 17 vertices and of a planar such graph with 39 vertices. Moreover, we find a 4‐connected almost hypohamiltonian graph, while Thomassen's question whether 4‐connected hypohamiltonian graphs exist remains open. We construct planar almost hypohamiltonian graphs of order n for every . During our investigation we draw connections between hypotraceable, hypohamiltonian, and almost hypohamiltonian graphs, and discuss a natural extension of almost hypohamiltonicity. Finally, we give a short argument disproving a conjecture of Chvátal (originally disproved by Thomassen), strengthen a result of Araya and Wiener on cubic planar hypohamiltonian graphs, and mention open problems.     

Snarks,Hypohamiltonian Graphs and Non-Supereulerian Graphs

A graph G is hypohamiltonian if it is not Hamiltonian but for each \(v\in V(G)\), the graph \(G-v\) is Hamiltonian. A graph is supereulerian if it has a spanning Eulerian subgraph. A graph G is called collapsible if for every even subset \(R\subseteq V(G)\), there is a spanning connected subgraph H of G such that R is the set of vertices of odd degree in H. A graph is reduced if it has no nontrivial collapsible subgraphs. In this note, we first prove that all hypohamiltonian cubic graphs are reduced non-supereulerian graphs. Then we introduce an operation to construct graphs from hypohamiltonian cubic graphs such that the resulting graphs are 3-edge-connected non-supereulerian reduced graphs and cannot be contracted to a snark. This disproves two conjectures, one of which was first posed by Catlin et al. in [Congr. Num. 76:173–181, 1990] and in [J. Combin. Theory, Ser B 66:123–139, 1996], and was posed again by Li et al. in [Acta Math. Sin. English Ser 30(2):291–304, 2014] and by Yang in [Supereulerian graphs, hamiltonicity of graphs and several extremal problems in graphs, Ph. D. Dissertation, Université Paris-Sub, September 27, 2013], respectively, the other one was posed by Yang 2013.     

An infinite Family of 4-Arc-Transitive Cubic Graphs Each with Girth 12

If p is any prime, and is that automorphism of the group SL(3,p) which takes each matrix to the transpose of its inverse,then there exists a connected trivalent graph (p) on vertices with the split extensionSL(3, p) as a group of automorphisms acting regularly on its4-arcs. In fact if p 3 then this group is the full automorphismgroup of (p), while the graph (3) is 5-arc-transitive with fullautomorphism group SL(3,3)0 x C₂. The girth of (p) is 12, exceptin th case p = 2 (where the girth is 6). Furthermore, in allcases (p) is bipartite, with SL(3, p) fixing each part. Alsowhen p 1 mod 3 the graph (p) is a triple cover of another trivalentgraph, which has automorphism group PSL(3, p)0 acting regularlyon its 4-arcs. These claims are proved using elementary theoryof symmetric graphs, together with a suitable choice of threematrices which generate SL(3, Z). They also provide a proofthat the group 4⁺(a¹²) described by Biggs in Computational grouptheor(ed. M. Atkinson) is infinite.     

Planar Hypohamiltonian Graphs on 40 Vertices

A graph is hypohamiltonian if it is not Hamiltonian, but the deletion of any single vertex gives a Hamiltonian graph. Until now, the smallest known planar hypohamiltonian graph had 42 vertices, a result due to Araya and Wiener. That result is here improved upon by 25 planar hypohamiltonian graphs of order 40, which are found through computer‐aided generation of certain families of planar graphs with girth 4 and a fixed number of 4‐faces. It is further shown that planar hypohamiltonian graphs exist for all orders greater than or equal to 42. If Hamiltonian cycles are replaced by Hamiltonian paths throughout the definition of hypohamiltonian graphs, we get the definition of hypotraceable graphs. It is shown that there is a planar hypotraceable graph of order 154 and of all orders greater than or equal to 156. We also show that the smallest planar hypohamiltonian graph of girth 5 has 45 vertices.     

An Infinite Family of Planar Hypohamiltonian Oriented Graphs

Carsten Thomassen asked in 1976 whether there exists a planar hypohamiltonian oriented graph. We answer his question by presenting an infinite family of planar hypohamiltonian oriented graphs, the smallest of which has order 9. A computer search showed that 9 is the smallest possible order of a hypohamiltonian oriented graph.     

Ramanujan Graphs with Small Girth

We construct an innite family of (q + 1)-regular Ramanujan graphs X _n of girth 1. We also give covering maps X _n+1 X _n such that the minimal common covering of all the X _n s is the universal covering tree.     

Locally Symmetric Graphs of Girth 4

We classify the family of connected, locally symmetric graphs of girth 4 (finite and infinite). They are all regular, with the exception of the complete bipartite graph . There are, up to isomorphism, exactly four such k‐regular graphs for every , one for , two for , and exactly three for every infinite cardinal k. In the last paragraph, we consider locally symmetric graphs of girth >4.     

原始图与三次图的可圈度

本文综述关于原始图与三次图的可圈度的近期结果并提出一些未解决的问题。     

Existence of Infinitely Many Non-Trivial Bifurcation Points

We consider the non-linear two point boundary value problem where λ > 0,f ∈ C², f′ ≥ 0, f(0) < 0 and lim_{u → ∞} f(u) > 0. By considering the non-negative as well as all sign changing solutions, we establish the existence of infinitely many non-trivial bifurcation points. Further, when f is superlinear, we prove that there exists a constant λ* > 0, such that for each λ ∈ (0, λ*) there are exactly two solutions with m interior zeros for every m = 1,2, …We apply our results to the case when f(u) = u ³ - k; k > 0, and also discuss the evolution of the bifurcation diagram as k → 0.     

On Existence of Infinitely Many Homoclinic Solutions

 In this note we prove some sufficient condition for the existence of homoclinic solutions in nonautonomous ODE’s. As an application we show that there exist infinitely many (geometrically distinct) homoclinic solutions to the trivial 0 solution in the planar system

Topological Subgraphs in Graphs of Large Girth

H of maximum degree , there is an integer g(H) such that every finite graph of minimum degree n and girth at least g(H) contains a subdivision of H. This had been conjectured for in [8]. We prove also that every finite 2n-connected graph of sufficiently large girth is n-linked, and this is best possible for all . Received: February 26, 1997     

系列平行图的围长和圆可选性

本文讨论了系列平行图的圆可选性．令x_(c,l)表示圆可选性(或圆列表着色数)．本文证明了围长至少是4n 1的系列平行图的圆可选性至多为2 1/n．     

On Locally Projective Graphs of Girth 5

Let be a graph and G be a 2-arc transitive automorphism group of . For a vertex x let G(x)^(x) denote the permutation group induced by the stabilizer G(x) of x in G on the set (x) of vertices adjacent to x in . Then is said to be a locally projective graph of type (n,q) if G(x)^(x) contains PSL_n(q) as a normal subgroup in its natural doubly transitive action. Suppose that is a locally projective graph of type (n,q), for some n 3, whose girth (that is, the length of a shortest cycle) is 5 and suppose that G(x) acts faithfully on (x). (The case of unfaithful action was completely settled earlier.) We show that under these conditions either n=4, q=2, has 506 vertices and , and contains the Wells graph on 32 vertices as a subgraph. In the latter case if, for a given n, at least one graph satisfying the conditions exists then there is a universal graph W(n) of which all other graphs for this n are quotients. The graph W(3) satisfies the conditions and has 2²⁰ vertices.