Some sufficient conditions for path-factor uniform graphs

DOI10.1007/s00010-023-00944-3OpenAlexW4322623894MaRDI QIDQ2699236

Zhi-ren Sun, Hongxia Liu, Si-zhong Zhou

Publication date: 26 April 2023

Published in: Aequationes Mathematicae (Search for Journal in Brave)

Full work available at URL: https://arxiv.org/abs/2204.09842

zbMATH Keywords

independence numberminimum degreeneighborhood\(P_{\geq 3}\)-factor\(P_{\geq 3}\)-factor uniform

Mathematics Subject Classification ID

Paths and cycles (05C38) Edge subsets with special properties (factorization, matching, partitioning, covering and packing, etc.) (05C70) Vertex subsets with special properties (dominating sets, independent sets, cliques, etc.) (05C69) Connectivity (05C40)

Related Items (6)

Some results about ID-path-factor critical 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 ⋮ \(\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

Cites Work

• Star-factors with large components
• On factors with given components
• Component factors with large components in graphs
• Characterizations for \({\mathcal{P}}_{\geq 2}\)-factor and \({\mathcal{P}}_{\geq 3}\)-factor covered graphs
• Neighborhood unions and factor critical graphs
• A necessary and sufficient condition for the existence of a path factor every component of which is a path of length at least two
• Independence number, connectivity and all fractional \((a, b, k)\)-critical graphs
• Toughness and isolated toughness conditions for \(P_{\ge 3}\)-factor uniform graphs
• A neighborhood union condition for fractional \((a, b, k)\)-critical covered graphs
• Discussions on orthogonal factorizations in digraphs
• On path-factor critical deleted (or covered) graphs
• Path factors in subgraphs
• A note on fractional ID-\( [ a , b \)-factor-critical covered graphs]
• Research on fractional critical covered graphs
• Tight binding number bound for \(P_{\geq 3}\)-factor uniform graphs
• A result on fractional \((a,b,k)\)-critical covered graphs
• Binding number conditions for \(P_{\geq 2}\)-factor and \(P_{\geq 3}\)-factor uniform graphs
• Two sufficient conditions for odd \([1,b\)-factors in graphs]
• Path and cycle factors of cubic bipartite graphs
• [https://portal.mardi4nfdi.de/wiki/Publication:4242796 An El-Zah�r type condition ensuring path-factors]
• A neighborhood condition for graphs to have restricted fractional (g,f)-factors
• On k-orthogonal factorizations in networks
• Independence number and connectivity for fractional (a, b, k)-critical covered graphs
• Isolated toughness for path factors in networks
• TOUGHNESS, ISOLATED TOUGHNESS AND PATH FACTORS IN GRAPHS
• Partitioning vertices of 1-tough graphs into paths
• Path factors and neighborhoods of independent sets in graphs

This page was built for publication: Some sufficient conditions for path-factor uniform graphs