4,162 research outputs found
On almost hypohamiltonian graphs
A graph is almost hypohamiltonian (a.h.) if is non-hamiltonian, there
exists a vertex in such that is non-hamiltonian, and is
hamiltonian for every vertex in . The second author asked in [J.
Graph Theory 79 (2015) 63--81] for all orders for which a.h. graphs exist. Here
we solve this problem. To this end, we present a specialised algorithm which
generates complete sets of a.h. graphs for various orders. Furthermore, we show
that the smallest cubic a.h. graphs have order 26. We provide a lower bound for
the order of the smallest planar a.h. graph and improve the upper bound for the
order of the smallest planar a.h. graph containing a cubic vertex. We also
determine the smallest planar a.h. graphs of girth 5, both in the general and
cubic case. Finally, we extend a result of Steffen on snarks and improve two
bounds on longest paths and longest cycles in polyhedral graphs due to
Jooyandeh, McKay, {\"O}sterg{\aa}rd, Pettersson, and the second author.Comment: 18 pages. arXiv admin note: text overlap with arXiv:1602.0717
On almost hypohamiltonian graphs
A graph G is almost hypohamiltonian (a.h.) if G is non-hamiltonian, there exists a vertex w in G such that G - w is non-hamiltonian, and G - v is hamiltonian for every vertex v \ne w in G. The second author asked in [J. Graph Theory 79 (2015) 63–81] for all orders for which a.h. graphs exist. Here we solve this problem. To this end, we present a specialised algorithm which generates complete sets of a.h. graphs for various orders. Furthermore, we show that the smallest cubic a.h. graphs have order 26. We provide a lower bound for the order of the smallest planar a.h. graph and improve the upper bound for the order of the smallest planar a.h. graph containing a cubic vertex. We also determine the smallest planar a.h. graphs of girth 5, both in the general and cubic case. Finally, we extend a result of Steffen on snarks and improve two bounds on longest paths and longest cycles in polyhedral graphs due to Jooyandeh, McKay, Östergård, Pettersson, and the second author
Computing Tutte Paths
Tutte paths are one of the most successful tools for attacking problems on long cycles in planar graphs. Unfortunately, results based on them are non-constructive, as their proofs inherently use an induction on overlapping subgraphs and these overlaps prevent any attempt to bound the running time by a polynomial.
For special cases however, computational results of Tutte paths are known: For 4-connected planar graphs, Tutte paths are in fact Hamiltonian paths and Chiba and Nishizeki [N. Chiba and T. Nishizeki, 1989] showed how to compute such paths in linear time. For 3-connected planar graphs, Tutte paths have a significantly more complicated structure, and it has only recently been shown that they can be computed in polynomial time [A. Schmid and J. M. Schmidt, 2015]. However, Tutte paths are defined for general 2-connected planar graphs and this is what most applications need. In this unrestricted setting, no computational results for Tutte paths are known.
We give the first efficient algorithm that computes a Tutte path (in this unrestricted setting). One of the strongest existence results about such Tutte paths is due to Sanders [D. P. Sanders, 1997], which allows one to prescribe the end vertices and an intermediate edge of the desired path. Encompassing and strengthening all previous computational results on Tutte paths, we show how to compute such a special Tutte path efficiently. Our method refines both, the existence results of Thomassen [C. Thomassen, 1983] and Sanders [D. P. Sanders, 1997], and avoids that the subgraphs arising in the inductive proof intersect in more than one edge by using a novel iterative decomposition along 2-separators. Finally, we show that our algorithm runs in time O(n^2)
Hypohamiltonian and almost hypohamiltonian graphs
This Dissertation is structured as follows. In Chapter 1, we give a short historical overview and define fundamental concepts. Chapter 2 contains a clear narrative of the progress made towards finding the smallest planar hypohamiltonian graph, with all of the necessary theoretical tools and techniques--especially Grinberg's Criterion. Consequences of this progress are distributed over all sections and form the leitmotif of this Dissertation. Chapter 2 also treats girth restrictions and hypohamiltonian graphs in the context of crossing numbers. Chapter 3 is a thorough discussion of the newly introduced almost hypohamiltonian graphs and their connection to hypohamiltonian graphs. Once more, the planar case plays an exceptional role. At the end of the chapter, we study almost hypotraceable graphs and Gallai's problem on longest paths. The latter leads to Chapter 4, wherein the connection between hypohamiltonicity and various problems related to longest paths and longest cycles are presented. Chapter 5 introduces and studies non-hamiltonian graphs in which every vertex-deleted subgraph is traceable, a class encompassing hypohamiltonian and hypotraceable graphs. We end with an outlook in Chapter 6, where we present a selection of open problems enriched with comments and partial results
- …