Date of Graduation


Document Type


Degree Type



Eberly College of Arts and Sciences



Committee Chair

Hong-Jian Lai.


Let C(l, k) denote the class of 2-edge-connected graphs of order n such that a graph G ∈ C(l, k) if and only if for every edge cut S ⊆ E(G) with |S| ≤ 3, each component of G - S has order at least n-kl . We prove that If G ∈ C(6, 0), then G is supereulerian if and only if G cannot be contracted to K2,3, K 2,5 or K2,3(e), where e ∈ E(K2,3) and K2,3(e) stands for a graph obtained from K2,3 by replacing e by a path of length 2. Previous results by Catlin and Li, and by Broersma and Xiong are extended.;We also investigate the supereulerian graph problems within planar graphs, and we prove that if a 2-edge-connected planar graph G is at most three edges short of having two edge-disjoint spanning trees, then G is supereulerian except a few classes of graphs. This is applied to show the existence of spanning Eulerian subgraphs in planar graphs with small edge cut conditions. We determine several extremal bounds for planar graphs to be supereulerian.;Kuipers and Veldman conjectured that any 3-connected claw-free graph with order n and minimum degree delta ≥ n+610 is Hamiltonian for n sufficiently large. We prove that if H is a 3-connected claw-free graph with sufficiently large order n, and if delta(H) ≥ n+510 , then either H is hamiltonian, or delta( H) = n+510 and the Ryjac˘ek's closure cl( H) of H is the line graph of a graph obtained from the Petersen graph P10 by adding n-1510 pendant edges at each vertex of P10.