9 research outputs found
On the minimum leaf number of cubic graphs
The \emph{minimum leaf number} of a connected graph is
defined as the minimum number of leaves of the spanning trees of . We
present new results concerning the minimum leaf number of cubic graphs: we show
that if is a connected cubic graph of order , then , improving on the best known result in [Inf. Process.
Lett. 105 (2008) 164-169] and proving the conjecture in [Electron. J. Graph
Theory and Applications 5 (2017) 207-211]. We further prove that if is also
2-connected, then , improving on the best
known bound in [Math. Program., Ser. A 144 (2014) 227-245]. We also present new
conjectures concerning the minimum leaf number of several types of cubic graphs
and examples showing that the bounds of the conjectures are best possible.Comment: 17 page
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
Spanning Halin Subgraphs Involving Forbidden Subgraphs
In structural graph theory, connectivity is an important notation with a lot of applications. Tutte, in 1961, showed that a simple graph is 3-connected if and only if it can be generated from a wheel graph by repeatedly adding edges between nonadjacent vertices and applying vertex splitting. In 1971, Halin constructed a class of edge-minimal 3-connected planar graphs, which are a generalization of wheel graphs and later were named “Halin graphs” by Lovasz and Plummer. A Halin graph is obtained from a plane embedding of a tree with no stems having degree 2 by adding a cycle through its leaves in the natural order determined according to the embedding. Since Halin graphs were introduced, many useful properties, such as Hamiltonian, hamiltonian-connected and pancyclic, have been discovered. Hence, it will reveal many properties of a graph if we know the graph contains a spanning Halin subgraph. But unfortunately, until now, there is no positive result showing under which conditions a graph contains a spanning Halin subgraph. In this thesis, we characterize all forbidden pairs implying graphs containing spanning Halin subgraphs. Consequently, we provide a complete proof conjecture of Chen et al. Our proofs are based on Chudnovsky and Seymour’s decomposition theorem of claw-free graphs, which were published recently in a series of papers