Sun toughness and $P_{\geq3}$-factors in graphs
From MaRDI portal
Publication:3299358
DOI10.11575/CDM.V14I1.62676zbMath1444.05115OpenAlexW3120612562MaRDI QIDQ3299358
Publication date: 22 July 2020
Full work available at URL: https://cdm.ucalgary.ca/article/download/62676/53784
sun toughness\(P_{\geq3}\)-factor\(P_{\geq3}\)-factor covered graph\(P_{\geq3}\)-factor deleted graph
Paths and cycles (05C38) Edge subsets with special properties (factorization, matching, partitioning, covering and packing, etc.) (05C70)
Related Items (5)
A degree condition for fractional \((g, f, n)\)-critical covered graphs ⋮ On path-factor critical deleted (or covered) graphs ⋮ Research on fractional critical covered graphs ⋮ A sufficient condition for the existence of restricted fractional \((g, f)\)-factors in graphs ⋮ Sun toughness conditions for \(P_2\) and \(P_3\) factor uniform and factor critical avoidable graphs
This page was built for publication: Sun toughness and $P_{\geq3}$-factors in graphs
