A necessary and sufficient condition for the existence of a path factor every component of which is a path of length at least two
type: Item
instance of: scholarly article
title: A necessary and sufficient condition for the existence of a path factor every component of which is a path of length at least two
zbMATH Open document ID: 1029.05125
DOI: 10.1016/S0095-8956(03)00027-3
author: Atsushi Kaneko
published in: Journal of Combinatorial Theory. Series B
publication date: 2003-08-17T00:00:00Z
Mathematics Subject Classification ID: 05C70
zbMATH DE Number: 1965027
zbMATH Keywords: sun
MaRDI profile type: Publication
cites work: Partitioning vertices of 1-tough graphs into paths
cites work: Q3818315
cites work: Q4405192
cites work: Q3880849
cites work: Matching theory
cites work: Path factors of bipartite graphs
full work available at URL: s0095-8956(03)00027-3
OpenAlex ID: W2037953913
Recommended article: Sufficient conditions for the existence of a path‐factor which are related to odd components
Recommended article: Some existence theorems on path factors with given properties in graphs
Recommended article: Q4624797
Recommended article: Q2936733
Recommended article: The existence of a path-factor without small odd paths
Recommended article: An El-Zah�r type condition ensuring path-factors
Recommended article: A sufficient condition for a graph to have \([a,b]\)-factors
Recommended article: Sufficient condition for the existence of an even \([a,b]\)-factor in graph
Recommended article: Some sufficient conditions for path-factor uniform graphs
Recommended article: Q4392231
description: scientific article; zbMATH DE number 1965027