Component factors with large components in graphs
For a set \(S\) of connected graphs, a spanning subgraph \(F\) of a graph \(G\) is called an \(S\)-factor or a component factor of \(G\) if every component of \(F\) is an element of \(S\). Since finding a maximum \(S\)-subgraph of a given graph is NP-complete, finding a criterion for a graph to have an \(S\)-factor is very difficult. The authors obtain several sufficient conditions in terms of the number of isolated vertices for a graph to have a component factor such that each component has order at least three.
scientific article; zbMATH DE number 5692719