Component factors with large components in graphs (Q963816): Difference between revisions
From MaRDI portal
Set OpenAlex properties. |
ReferenceBot (talk | contribs) Changed an Item |
||
| Property / cites work | |||
| Property / cites work: On factors with given components / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: Packing paths of length at least two / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: A necessary and sufficient condition for the existence of a path factor every component of which is a path of length at least two / rank | |||
Normal rank | |||
Latest revision as of 16:11, 2 July 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
