Some results on path-factor critical avoidable graphs

DOI10.7151/dmgt.2364zbMath1504.05236OpenAlexW3092050107MaRDI QIDQ2107757

Si-zhong Zhou

Publication date: 2 December 2022

Published in: Discussiones Mathematicae. Graph Theory (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.7151/dmgt.2364

zbMATH Keywords

toughnessisolated toughness\((P_{ \geq k}, n)\)-factor critical avoidable graph\(P_{\geq k}\)-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)

Related Items (19)

A neighborhood condition for graphs to have restricted fractional (g,f)-factors ⋮ On path-factor critical deleted (or covered) graphs ⋮ Path factors in subgraphs ⋮ A note on fractional ID-\( [ a , b \)-factor-critical covered graphs] ⋮ Some results about ID-path-factor critical 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 odd \([1,b\)-factors in graphs] ⋮ Two Sufficient Conditions for Graphs to Admit Path Factors ⋮ Degree conditions for the existence of a {P₂, P₅}-factor in a graph ⋮ Sufficient conditions for graphs to have strong parity factors ⋮ Toughness for fractional \((2, b, k)\)-critical covered graphs ⋮ \(\mathcal{D}\)-index and \(\mathcal{Q}\)-index for spanning trees with leaf degree at most \(k\) in graphs ⋮ The \(A_\alpha\)-spectral radius for path-factors in graphs ⋮ Binding numbers and restricted fractional \(( g , f )\)-factors in graphs ⋮ A result on fractional \((a,b,k)\)-critical covered graphs ⋮ Degree conditions for \(k\)-Hamiltonian \([a,b\)-factors] ⋮ A neighborhood union condition for fractional \((a, b, k)\)-critical covered graphs

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Packing 3-vertex paths in claw-free graphs and related topics
• 1-factor covers of regular graphs
• Component factors with large components in graphs
• An extension of Tutte's 1-factor theorem
• A necessary and sufficient condition for the existence of a path factor every component of which is a path of length at least two
• Toughness of graphs and the existence of factors
• 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
• Binding number conditions for \(P_{\geq 2}\)-factor and \(P_{\geq 3}\)-factor uniform graphs
• A toughness condition for fractional \((k, m)\)-deleted graphs revisited
• Degree conditions for fractional \((a,b,k)\)-critical covered graphs
• A toughness condition for fractional \((k,m)\)-deleted graphs
• Tough graphs and Hamiltonian circuits.
• Remarks on orthogonal factorizations of digraphs
• Remarks on path factors in graphs
• Toughness and the existence ofk-factors
• Sufficient conditions for the existence of a path‐factor which are related to odd components

This page was built for publication: Some results on path-factor critical avoidable graphs