Characterizations for \({\mathcal{P}}_{\geq 2}\)-factor and \({\mathcal{P}}_{\geq 3}\)-factor covered graphs

DOI10.1016/j.disc.2008.04.022zbMath1205.05187OpenAlexW2012966668MaRDI QIDQ1025460

Shan Zhou, Heping Zhang

Publication date: 19 June 2009

Published in: Discrete Mathematics (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.disc.2008.04.022

zbMATH Keywords

\({\mathcal{P}}_{\geq 2}\)-factor\({\mathcal{P}}_{\geq 2}\)-factor covered graph\({\mathcal{P}}_{\geq 3}\)-factor\({\mathcal{P}}_{\geq 3}\)-factor covered graph

Mathematics Subject Classification ID

Edge subsets with special properties (factorization, matching, partitioning, covering and packing, etc.) (05C70)

Related Items

On path-factor critical deleted (or covered) graphs ⋮ Path factors in subgraphs ⋮ The existence of \(P_{\geq3}\)-factor covered graphs ⋮ Some results about ID-path-factor critical 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 ⋮ Isolated toughness and path-factor uniform graphs. II. ⋮ 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 ⋮ Matching extension and matching exclusion via the size or the spectral radius of graphs ⋮ Some sufficient conditions for path-factor uniform graphs ⋮ Tight binding number bound for \(P_{\geq 3}\)-factor uniform graphs ⋮ Characterizing \(\mathcal{P}_{\geqslant 2} \)-factor and \(\mathcal{P}_{\geqslant 2} \)-factor covered graphs with respect to the size or the spectral radius ⋮ Binding number conditions for \(P_{\geq 2}\)-factor and \(P_{\geq 3}\)-factor uniform graphs ⋮ 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 ⋮ Some results about component factors in graphs ⋮ The existence of path-factor covered graphs ⋮ TOUGHNESS, ISOLATED TOUGHNESS AND PATH FACTORS IN GRAPHS

Cites Work

• Unnamed Item
• Unnamed Item
• A necessary and sufficient condition for the existence of a path factor every component of which is a path of length at least two
• The Edmonds-Gallai decomposition for the \(k\)-piece packing problem
• Packing paths of length at least two
• The k‐piece packing problem