A graph G is called K1; n-free if G has no induced subgraph isomorphic to K1; n. Let n, a, and b be integers with nÂ¿3, aÂ¿1, and bÂ¿a(n âˆ’ 2) + 2. We prove that every connected K1; n-free graph G has aâ€¦ (More)

Let G be a graph, and g, f , f 0 be positive integer-valued functions defined on V Ã°GÃž. If an f 0-factor of G is a spanning tree, we say that it is f 0-tree. In this paper, it is shown that Gâ€¦ (More)