Remarks on path factors in graphs

DOI10.1051/RO/2019111MaRDI QIDQ3389388zbMATH OpenOpenAlexFDO

Authors Sizhong 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

connectivitybinding numberpath factor

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)

Recommendations

• scientific article; zbMATH DE number 3893247
• Some remarks about factors of graphs
• Remarks on component factors in graphs
• Path factors in subgraphs
• Path factors of bipartite graphs
• Degree sums and path-factors in graphs
• Some existence theorems on path factors with given properties in graphs
• On path factorizations of complete multipartite graphs
• Path factorizations of complete multipartite graphs
• Induced path factors of regular graphs

Cited in

(36)

• Binding number and path-factor critical deleted graphs
• Path factors and neighborhoods of independent sets in graphs
• The existence of subdigraphs with orthogonal factorizations in digraphs
• On path-factor critical deleted (or covered) graphs
• Path-factors involving paths of order seven and nine
• Tight binding number bound for \(P_{\geq 3}\)-factor uniform graphs
• Discussion on fractional \((a, b, k)\)-critical covered graphs
• Discussions on orthogonal factorizations in digraphs
• A note on fractional ID-\( [ a , b ]\)-factor-critical covered graphs
• Research on fractional critical covered graphs
• Characterizing \(\mathcal{P}_{\geqslant 2}\)-factor deleted graphs with respect to the size or the spectral radius
• On \(P_{\geq 3}\)-factor deleted graphs
• Some results on path-factor critical avoidable 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
• An existence theorem on fractional ID-\((g, f)\)-factor-critical covered graphs
• A note on path-zero graphs
• Some existence theorems on path-factor critical avoidable graphs
• Isolated toughness and path-factor uniform graphs. II.
• Toughness, isolated toughness and path factors in graphs
• Degree conditions for \(k\)-Hamiltonian \([a,b]\)-factors
• Toughness for fractional \((2, b, k)\)-critical covered graphs
• Independence number, minimum degree and path-factors in graphs
• Isolated toughness and \(P_{\ge 3}\)-factors in graphs
• Path factors in subgraphs
• Degree conditions for path-factor critical deleted or covered graphs
• Nash-Williams conditions for the existence of all fractional \([a,b]\)-factors
• Subgraphs with orthogonal factorizations in graphs
• Some existence theorems on path factors with given properties in graphs
• Two Sufficient Conditions for Graphs to Admit Path Factors
• Remarks on component factors
• Component factors and binding number conditions in graphs
• A result on fractional \((a,b,k)\)-critical covered graphs
• Isolated toughness and \(k\)-Hamiltonian \([a,b]\)-factors
• Sufficient conditions for a graph \(kG\) admitting all \([1, k]\)-factors
• A neighborhood union condition for fractional \((a, b, k)\)-critical covered graphs

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

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3389388)