Two-tough graphs and f-factors with given properties
Abstract
Let G be a 2-tough graph on at least five vertices and let e 1,e2 be any two edges of G. Katerinis and Wang [6] showed that there exists a 2-factor in G including/excluding e1 and e 2. In this paper,we generalize their result by considering the existence of an f-factor including/excluding e1 and e 2,where f:V(G)→{1,2}.











