Remarks on path factors in graphs

DOI10.1051/RO/2019111zbMath1462.05307OpenAlexW2990898510MaRDI QIDQ3389388

Si-zhong Zhou

Publication date: 10 May 2021

Published in: RAIRO - Operations Research (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1051/ro/2019111

zbMATH Keywords

connectivitypath factorbinding number

Mathematics Subject Classification ID

Deterministic network models in operations research (90B10) Paths and cycles (05C38) Edge subsets with special properties (factorization, matching, partitioning, covering and packing, etc.) (05C70)

Related Items (27)

Discussion on fractional \((a, b, k)\)-critical covered graphs ⋮ Discussions on orthogonal factorizations in digraphs ⋮ The existence of subdigraphs with orthogonal factorizations in digraphs ⋮ Component factors and binding number conditions in graphs ⋮ On path-factor critical deleted (or covered) graphs ⋮ Path factors in subgraphs ⋮ A note on fractional ID-\( [ a , b \)-factor-critical covered graphs] ⋮ An existence theorem on fractional ID-(g, f)-factor-critical covered graphs ⋮ Remarks on component factors ⋮ Path factors and neighborhoods of independent sets in graphs ⋮ Isolated toughness and path-factor uniform graphs. II. ⋮ Two Sufficient Conditions for Graphs to Admit Path Factors ⋮ Toughness for fractional \((2, b, k)\)-critical covered graphs ⋮ Some existence theorems on path factors with given properties in graphs ⋮ Subgraphs with orthogonal factorizations in graphs ⋮ Research on fractional critical covered graphs ⋮ A sufficient condition for the existence of restricted fractional \((g, f)\)-factors in graphs ⋮ Tight binding number bound for \(P_{\geq 3}\)-factor uniform graphs ⋮ A result on fractional \((a,b,k)\)-critical covered graphs ⋮ Nash-Williams conditions for the existence of all fractional \([a,b\)-factors] ⋮ Isolated toughness and \(k\)-Hamiltonian \([a,b\)-factors] ⋮ Degree conditions for \(k\)-Hamiltonian \([a,b\)-factors] ⋮ Sun toughness conditions for \(P_2\) and \(P_3\) factor uniform and factor critical avoidable graphs ⋮ A neighborhood union condition for fractional \((a, b, k)\)-critical 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

This page was built for publication: Remarks on path factors in graphs