Binding number conditions for path-factor uniform graphs

DOI10.1007/S40840-025-01902-9MaRDI QIDQ6952170zbMATH OpenFDO

Authors Ping Zhang

Publication date 28 July 2025

Published in Bulletin of the Malaysian Mathematical Sciences Society. Second Series (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/S40840-025-01902-9

zbMATH Keywords

\(k\)-connected graphbinding numberpath-factor uniform

Mathematics Subject Classification ID

Paths and cycles (05C38) Connectivity (05C40) Isomorphism problems in graph theory (reconstruction conjecture, etc.) and homomorphisms (subgraph embedding, etc.) (05C60) Edge subsets with special properties (factorization, matching, partitioning, covering and packing, etc.) (05C70)

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
• A note on path factors in claw-free graphs.
• Binding number and path-factor critical deleted graphs
• Binding number conditions for \(P_{\geq 2}\)-factor and \(P_{\geq 3}\)-factor uniform graphs
• Characterizations for \({\mathcal{P}}_{\geq 2}\)-factor and \({\mathcal{P}}_{\geq 3}\)-factor covered graphs
• Degree conditions for path-factors in graphs
• Degree conditions for the existence of a {P₂, P₅}-factor in a graph
• Degree sum conditions for path-factor uniform graphs
• scientific article; zbMATH DE number 3720956 (Why is no real title available?)
• Independence number and minimum degree for path-factor critical uniform graphs
• Isolated toughness for path factors in networks
• On packing 3-vertex paths in a graph
• On path-factor critical uniform graphs
• On the completeness of a generalized matching problem
• On the Complexity of General Graph Factor Problems
• Packing paths of length at least two
• Path factors in claw-free graphs
• Path factors in cubic graphs
• Path factors in subgraphs
• Remarks on component factors in graphs
• Some degree conditions for \(\mathcal{P}_{\geq k}\)-factor covered graphs
• The A_-spectral radius for path-factors in graphs
• The binding number of a graph and its Anderson number
• The existence of a path-factor without small odd paths
• The existence of path-factor covered graphs
• The existence of path-factor uniform graphs with large connectivity
• The Factorization of Linear Graphs
• Tight binding number bound for \(P_{\geq 3}\)-factor uniform graphs
• Toughness and isolated toughness conditions for \(P_{\ge 3}\)-factor uniform graphs
• Toughness, isolated toughness and path factors in graphs

Cited in

(1)

• Characterizing path-factor uniform graphs with respect to the degree sum of non-adjacent vertices

This page was built for publication: Binding number 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 Q6952170)