Contents

-

Fan-Type Conditions for Collapsible Graphs

Zhi-Hong Chen1
1 Department of Mathematics/Computer Science Butler University, Indianapolis, IN 46208

Abstract

A graph G is collapsible if for every even subset RV(G), there is a spanning connected subgraph of G whose set of odd degree vertices is R. A graph is supereulerian if it contains a spanning closed trail. It is known that every collapsible graph is supereulerian. A graph G of order n is said to satisfy a Fan-type condition if max{d(u),d(v)}n(g2)pϵ for each pair of vertices u,v at distance two, where g{3,4} is the girth of G, and p2 and ϵ0 are fixed numbers. In this paper, we study the Fan-type conditions for collapsible graphs and supereulerian graphs.