THE FORBIDDEN SUBGRAPHS CONDITION FOR THE EXISTENCE OF SPANNING f-TREES
Let G be a graph and f be a mapping from to the positive integers. A subgraph T of G is called an f-tree if T forms a tree and for any In this paper, we give a sufficient condition using the condition on forbidden subgraphs for a graph G to have a spanning f-tree.
forbidden subgraphs, f-trees.
