Component factors with large components in graphs (Q963816): Difference between revisions
From MaRDI portal
Set profile property. |
Set OpenAlex properties. |
||
| Property / full work available at URL | |||
| Property / full work available at URL: https://doi.org/10.1016/j.aml.2009.11.003 / rank | |||
Normal rank | |||
| Property / OpenAlex ID | |||
| Property / OpenAlex ID: W2074508519 / rank | |||
Normal rank | |||
Revision as of 20:46, 19 March 2024
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Component factors with large components in graphs |
scientific article |
Statements
Component factors with large components in graphs (English)
0 references
14 April 2010
0 references
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.
0 references
component factors
0 references
Isolated vertices
0 references
