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.05125OpenAlexW2037953913MaRDI QIDQ1400955
Publication date: 17 August 2003
Published in: Journal of Combinatorial Theory. Series B (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/s0095-8956(03)00027-3
Related Items (53)
Path cover problems with length cost ⋮ On path-factor critical deleted (or covered) graphs ⋮ Path factors in subgraphs ⋮ Graph factors and factorization: 1985--2003: a survey ⋮ \(P_3\)-factors in the square of a tree ⋮ The existence of \(P_{\geq3}\)-factor covered graphs ⋮ Packing 3-vertex paths in claw-free graphs and related topics ⋮ Some results about ID-path-factor critical graphs ⋮ Remarks on component factors ⋮ Packing 2- and 3-stars into cubic graphs ⋮ Forbidden restrictions and the existence of \(P_{\geq 2}\)-factor and \(P_{\geq 3}\)-factor ⋮ Path factors and neighborhoods of independent sets in graphs ⋮ Binding number and path-factor critical deleted graphs ⋮ Isolated toughness and path-factor uniform graphs. II. ⋮ Two Sufficient Conditions for Graphs to Admit Path Factors ⋮ The maximum 4-vertex-path packing of a cubic graph covers at least two-thirds of its vertices ⋮ Complete characterization of path-factor and path-factor covered graphs via Q -index and D -index ⋮ Some existence theorems on path factors with given properties in graphs ⋮ Characterizing \(\mathcal{P}_{\geqslant 2}\)-factor deleted graphs with respect to the size or the spectral radius ⋮ Sun toughness and path-factor uniform graphs ⋮ Path-factor critical covered graphs and path-factor uniform graphs ⋮ Packing $k$-Matchings and $k$-Critical Graphs ⋮ Some sufficient conditions for path-factor uniform graphs ⋮ Packing paths: recycling saves time ⋮ Path-factors in the square of a tree ⋮ Tight binding number bound for \(P_{\geq 3}\)-factor uniform graphs ⋮ Spanning \(k\)-forests with large components in \(K_{1,k+1}\)-free graphs ⋮ Characterizing \(\mathcal{P}_{\geqslant 2} \)-factor and \(\mathcal{P}_{\geqslant 2} \)-factor covered graphs with respect to the size or the spectral radius ⋮ The path partition problem and related problems in bipartite graphs ⋮ The existence of a path-factor without small odd paths ⋮ Component factors with large components in graphs ⋮ Path factors and parallel knock-out schemes of almost claw-free graphs ⋮ Path cover problems with length cost ⋮ Faster algorithm for finding maximum 1-restricted simple 2-matchings ⋮ Packingk-edge trees in graphs of restricted vertex degrees ⋮ A note on \({\mathtt V}\)-free 2-matchings ⋮ Binding number conditions for \(P_{\geq 2}\)-factor and \(P_{\geq 3}\)-factor uniform graphs ⋮ An Edmonds-Gallai-type decomposition for the \(j\)-restricted \(k\)-matching problem ⋮ On path factors of \((3,4)\)-biregular bigraphs ⋮ Packing trees with constraints on the leaf degree ⋮ Sun toughness conditions for \(P_2\) and \(P_3\) factor uniform and factor critical avoidable graphs ⋮ Toughness and isolated toughness conditions for \(P_{\ge 3}\)-factor uniform graphs ⋮ Characterizations for \({\mathcal{P}}_{\geq 2}\)-factor and \({\mathcal{P}}_{\geq 3}\)-factor covered graphs ⋮ Unnamed Item ⋮ Path factors in cubic graphs ⋮ Packing paths of length at least two ⋮ Some results about component factors in graphs ⋮ The Nonnegative Node Weight j-Restricted k-Matching Problems ⋮ The spectral radius and \({\mathcal{P}}_{\ge \ell}\)-factors of graphs involving minimum degree ⋮ The existence of path-factor covered graphs ⋮ Some results on path-factor critical avoidable graphs ⋮ TOUGHNESS, ISOLATED TOUGHNESS AND PATH FACTORS IN GRAPHS ⋮ On \(P_{\geq 3}\)-factor deleted graphs
Cites Work
This page was built for publication: A necessary and sufficient condition for the existence of a path factor every component of which is a path of length at least two
