A necessary and sufficient condition for the existence of a path factor every component of which is a path of length at least two
From MaRDI portal
Publication:1400955
DOI10.1016/S0095-8956(03)00027-3zbMath1029.05125MaRDI QIDQ1400955
Publication date: 17 August 2003
Published in: Journal of Combinatorial Theory. Series B (Search for Journal in Brave)
05C70: Edge subsets with special properties (factorization, matching, partitioning, covering and packing, etc.)
Related Items
Unnamed Item, Packing 3-vertex paths in claw-free graphs and related topics, Graph factors and factorization: 1985--2003: a survey, Path-factors in the square of a tree, Component factors with large components in graphs, Path factors and parallel knock-out schemes of almost claw-free graphs, On path factors of \((3,4)\)-biregular bigraphs, Packing trees with constraints on the leaf degree, Characterizations for \({\mathcal{P}}_{\geq 2}\)-factor and \({\mathcal{P}}_{\geq 3}\)-factor covered graphs, Packing paths of length at least two, The path partition problem and related problems in bipartite graphs, Packingk-edge trees in graphs of restricted vertex degrees, Path factors in cubic graphs
Cites Work
