Copyright (c) 2010 All rights reserved. http://works.bepress.com/zhi_hong_chen Recent documents in Zhi-Hong Chen en-us Fri, 01 Oct 2010 01:32:55 PDT 3600 http://works.bepress.com/zhi_hong_chen/8 http://works.bepress.com/zhi_hong_chen/8 Wed, 29 Sep 2010 11:36:11 PDT Uses the reduction method of Catlin Zhi-Hong Chen http://works.bepress.com/zhi_hong_chen/7 http://works.bepress.com/zhi_hong_chen/7 Wed, 29 Sep 2010 11:33:00 PDT This dissertation is primarily focused on conditions for the existence of spanning closed trails in graphs. However, results in my dissertation and the method we used, which was invented by Catlin, are not only useful for finding spanning closed trails in graphs, but also useful to study double cycle cover problems, hamiltonian line graphs problems, and dominating closed trail problems, etc. A graph is called supereulerian if it contains a spanning closed trail. Several, people have worked on the conditions for spanning closed trails having the form "d(u) + d(v) $>$ cn (0 $<$ c $<$ 1)" for all edge uv in graph, as in the paper of Benhocine, Clark, Kohler and Veldman (3), etc. When obtaining good sufficient conditions having the form "d(u) + d(v) $>$ cn", it is useful to show that a graph G is either supereulerian or it can be contracted to a nonsupereulerian graph G$\sp\prime$ having a large matching. This was done. For example, we show that if a 3-edge-connected simple graph has no spanning closed trail then it can be contracted to a nonsupereulerian graph G$\sp\prime$ of order n $\sp\prime$ whose maximum matching has size at least (n$\sp\prime$ + 4)/3, and it is best possible. By using this result, we show that if G is a 3-edge-connected simple graph of order n, if for every edge uv, d(u) + d(v) $\geq$ $n \over 5$ $-$ 2, then either G has a spanning closed trail of G is contractible to the Petersen graph. By a theorem of Harary and Nash-Williams, this implies that either the line graph L(G) is hamiltonian or G can be contracted to the Petersen graph. This proves a conjecture of Benhocine, Clark, Kohler and Veldmann (3) for 3-edge-connected graphs, and with a stronger conclusion. We also study the conditions for supereulerian graphs having form "$\sum\sbsp{i=1}{t} d(u\sb{i})$ $>$ cn" (0 $<$ c $<$ 1) where t is a positive integer and no two vertices of $\{ u\sb1,\ u\sb2,\cdots u\sb{t} \}$ are adjacent. We obtain some best possible results on this aspect which improve the results of Benhocine, Clark, Kohler, & Veldman (3), Calin (11), (13), (14), Clark (24), Z. Q. Chen & Y. F. Xue (23), Lesniak-Foster & Willianson (30) and Veldman (36) significantly. We also study the following extremal graph theory problem: For a family F of graphs and for a natural number n, what is the maximum size of simple graphs of order n which are not in F, where F = $\{$supereulerian graphs with clique number $m\}$. (Note that when F = $\{$graphs with clique number at least $m\}$, this is Turan's Theorem.) One of our results proves a conjecture of Cai (10). Zhi-Hong Chen Mathematics http://works.bepress.com/zhi_hong_chen/5 http://works.bepress.com/zhi_hong_chen/5 Wed, 05 May 2010 13:31:50 PDT No abstract available Zhi-Hong Chen http://works.bepress.com/zhi_hong_chen/4 http://works.bepress.com/zhi_hong_chen/4 Wed, 05 May 2010 13:31:49 PDT A graph is claw-free if it has no induced K 1,3, subgraph. A graph is essential 4-edge-connected if removing at most three edges, the resulting graph has at most one component having edges. In this note, we show that every essential 4-edge-connected claw free graph has a spanning Eulerian subgraph with maximum degree at most 4. Zhi-Hong Chen http://works.bepress.com/zhi_hong_chen/3 http://works.bepress.com/zhi_hong_chen/3 Wed, 05 May 2010 13:31:29 PDT No abstract available Zhi-Hong Chen http://works.bepress.com/zhi_hong_chen/2 http://works.bepress.com/zhi_hong_chen/2 Tue, 02 Mar 2010 08:14:09 PST For an integer k > 0, a graph G is k-triangular if every edge of G lies in at least k distinct 3-cycles of G. In (J Graph Theory 11:399–407 (1987)), Broersma and Veldman proposed an open problem: for a given positive integer k, determine the value s for which the statement “Let G be a k-triangular graph. Then L(G), the line graph of G, is s-hamiltonian if and only L(G) is (s + 2)-connected” is valid. Broersma and Veldman proved in 1987 that the statement above holds for 0 ≤ s ≤ k and asked, specifically, if the statement holds when s = 2k. In this paper, we prove that the statement above holds for 0 ≤ s ≤ max{2k, 6k − 16}. Zhi-Hong Chen