On path-factor critical uniform graphs

DOI10.1007/S13226-023-00428-9MaRDI QIDQ6669293zbMATH OpenFDO

Authors Hongxia Liu

Publication date 22 January 2025

Published in Indian Journal of Pure \& Applied Mathematics (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/S13226-023-00428-9

zbMATH Keywords

binding number\(P_{\geq 3}\)-factor\(P_{\geq 2}\)-factor\((P_{\geq 2}, n)\)-critical uniform graph\((P_{\geq 3}, n)\)-critical uniform graph

Mathematics Subject Classification ID

Paths and cycles (05C38) Edge subsets with special properties (factorization, matching, partitioning, covering and packing, etc.) (05C70)

Recommendations

• Independence number and minimum degree for path-factor critical uniform graphs
• The existence of path-factor uniform graphs with large connectivity
• Binding number conditions for \(P_{\geq 2}\)-factor and \(P_{\geq 3}\)-factor uniform graphs
• Path-factor critical covered graphs and path-factor uniform graphs
• Some sufficient conditions for path-factor uniform graphs

Cites work

• scientific article; zbMATH DE number 3720956 (Why is no real title available?)
• scientific article; zbMATH DE number 7691485 (Why is no real title available?)
• A necessary and sufficient condition for the existence of a path factor every component of which is a path of length at least two
• A neighborhood union condition for fractional \((a, b, k)\)-critical covered graphs
• A note on fractional ID-\( [ a , b ]\)-factor-critical covered graphs
• A result on fractional \((a,b,k)\)-critical covered graphs
• An El-Zah�r type condition ensuring path-factors
• Binding number and path-factor critical deleted graphs
• Binding number conditions for \(P_{\geq 2}\)-factor and \(P_{\geq 3}\)-factor uniform graphs
• Binding number for path-factor uniform graphs
• Characterizations for \({\mathcal{P}}_{\geq 2}\)-factor and \({\mathcal{P}}_{\geq 3}\)-factor covered graphs
• Component factors with large components in graphs
• Isolated toughness for path factors in networks
• On \(P_{\geq 3}\)-factor deleted graphs
• On path-factor critical deleted (or covered) graphs
• Packing 3-vertex paths in claw-free graphs and related topics
• Packing paths of length at least two
• Partitioning vertices of 1-tough graphs into paths
• Path factors in subgraphs
• Path-factor critical covered graphs and path-factor uniform graphs
• Remarks on restricted fractional (g, f)-factors in graphs
• Research on fractional critical covered graphs
• Some sufficient conditions for path-factor uniform graphs
• Sufficient conditions for the existence of a path-factor which are related to odd components
• The binding number of a graph and its Anderson number
• The existence of path-factor uniform graphs with large connectivity
• Tight binding number bound for \(P_{\geq 3}\)-factor uniform graphs
• Toughness, isolated toughness and path factors in graphs
• Two sufficient conditions for odd \([1,b]\)-factors in graphs

Cited in

(3)

• Binding number conditions for path-factor uniform graphs
• Laplacian eigenvalue condition for a graph to have the strong parity property
• Independence number and minimum degree for path-factor critical uniform graphs

This page was built for publication: On path-factor critical uniform graphs

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