Degree sum conditions for path-factor uniform graphs

DOI10.1007/S13226-023-00446-7MaRDI QIDQ6669307zbMATH OpenFDO

Authors Guowei Dai

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-00446-7

zbMATH Keywords

\(P_{\geq 2}\)-factor uniform graph\(P_{\geq 3}\)-factor uniform graphdegree sumgraphpath-factor

Mathematics Subject Classification ID

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

Recommendations

• Some sufficient conditions for path-factor uniform graphs
• The existence of path-factor uniform graphs with large connectivity
• Toughness and isolated toughness conditions for \(P_{\ge 3}\)-factor uniform graphs
• Binding number conditions for \(P_{\geq 2}\)-factor and \(P_{\geq 3}\)-factor uniform graphs
• Isolated toughness and path-factor uniform graphs. II.

Cites work

• \(P_3\)-factors in the square of a tree
• A necessary and sufficient condition for the existence of a path factor every component of which is a path of length at least two
• 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
• Factors and factorizations of graphs. Proof techniques in factor theory
• Factors and factorizations of graphs—a survey
• Graph Factors and Matching Extensions
• scientific article; zbMATH DE number 3720956 (Why is no real title available?)
• On factors with given components
• On packing 3-vertex paths in a graph
• On path-factor critical deleted (or covered) graphs
• Packing paths of length at least two
• Partitioning vertices of 1-tough graphs into paths
• Path factors and neighborhoods of independent sets in graphs
• Path factors in claw-free graphs
• Path factors in cubic graphs
• Path factors in subgraphs
• Path factors of bipartite graphs
• Remarks on component factors
• Remarks on component factors in graphs
• Some degree conditions for \(\mathcal{P}_{\geq k}\)-factor covered graphs
• Some results about component factors in graphs
• Sufficient conditions for graphs with {P₂, P₅}-factors
• Sufficient conditions for the existence of a path-factor which are related to odd components
• Sun toughness and \(P_{\geq3}\)-factors in graphs
• The existence of \(P_{\geq3}\)-factor covered graphs
• The existence of path-factor covered graphs
• The existence of path-factor uniform graphs with large connectivity
• The Factors of Graphs
• Toughness and isolated toughness conditions for \(P_{\ge 3}\)-factor uniform graphs
• Toughness, isolated toughness and path factors in graphs

Cited in

(4)

• Degree conditions for the existence of a {P₂, P₅}-factor in a graph
• Independence number and minimum degree for path-factor critical uniform graphs
• Characterizing path-factor uniform graphs with respect to the degree sum of non-adjacent vertices
• Binding number conditions for path-factor uniform graphs

This page was built for publication: Degree sum conditions for path-factor uniform graphs

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