Path factors and neighborhoods of independent sets in graphs

DOI10.1007/s10255-022-1096-2zbMath1512.05343OpenAlexW4366400921MaRDI QIDQ6100418

Si-zhong Zhou

Publication date: 12 May 2023

Published in: Acta Mathematicae Applicatae Sinica. English Series (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/s10255-022-1096-2

zbMATH Keywords

independent setneighborhood\(P_{\geq 3}\)-factor\(P_{\geq 3}\)-factor covered graph

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)

Related Items (7)

Forbidden restrictions and the existence of \(P_{\geq 2}\)-factor and \(P_{\geq 3}\)-factor ⋮ Binding number and path-factor critical deleted graphs ⋮ Isolated toughness and path-factor uniform graphs. II. ⋮ Sufficient conditions for graphs to have strong parity factors ⋮ Sun toughness and path-factor uniform graphs ⋮ Path-factor critical covered graphs and path-factor uniform graphs ⋮ Some sufficient conditions for path-factor uniform graphs

Cites Work

• Sufficient condition for the existence of an even \([a,b\)-factor in graph]
• 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
• Toughness and isolated toughness conditions for \(P_{\ge 3}\)-factor uniform graphs
• A neighborhood union condition for fractional \((a, b, k)\)-critical covered graphs
• Some results on path-factor critical avoidable graphs
• On \(P_{\geq 3}\)-factor deleted 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
• Binding numbers and restricted fractional \(( g , f )\)-factors in graphs
• A result on fractional \((a,b,k)\)-critical covered graphs
• Neighborhood-union condition for an \([a, b\)-factor avoiding a specified Hamiltonian cycle]
• Two sufficient conditions for odd \([1,b\)-factors in graphs]
• Remarks on path 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
• A Note of Generalization of Fractional ID-factor-critical Graphs
• TOUGHNESS, ISOLATED TOUGHNESS AND PATH FACTORS IN GRAPHS
• Partitioning vertices of 1-tough graphs into paths

This page was built for publication: Path factors and neighborhoods of independent sets in graphs