Component factors with large components in graphs
type: Item
instance of: scholarly article
title: Component factors with large components in graphs
zbMATH Open document ID: 1213.05158
author: Hongliang Lu
author: Qinglin Roger Yu
author: Mikio Kano
published in: Applied Mathematics Letters
publication date: 2010-04-14T00:00:00Z
review text: 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.
Mathematics Subject Classification ID: 05C40
Mathematics Subject Classification ID: 05C70
zbMATH DE Number: 5692719
zbMATH Keywords: component factors
zbMATH Keywords: Isolated vertices
MaRDI profile type: Publication
full work available at URL: j.aml.2009.11.003
OpenAlex ID: W2074508519
cites work: On factors with given components
cites work: Packing paths of length at least two
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
DOI: 10.1016/J.AML.2009.11.003
Recommended article: Some results about component factors in graphs
Recommended article: Remarks on component factors in graphs
Recommended article: Large even factors of graphs
Recommended article: Component factors and induced subgraphs
Recommended article: Factors and factorization of graphs
Recommended article: Component factors and binding number conditions in graphs
Recommended article: Giant components in Kronecker graphs
Recommended article: High degree graphs contain large-star factors
Recommended article: Q4877004
Recommended article: Q5492666
description: scientific article; zbMATH DE number 5692719