Binding number and path-factor critical deleted graphs
From MaRDI portal
Publication:6101463
DOI10.1080/09728600.2022.2094299zbMath1512.05332OpenAlexW4283812487MaRDI QIDQ6101463
Publication date: 1 June 2023
Published in: AKCE International Journal of Graphs and Combinatorics (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1080/09728600.2022.2094299
path-factorbinding number\(P_{\ge 3}\)-factor\((P_{\ge 3}, n)\)-factor critical deleted graph\(P_{\ge 3}\)-factor deleted graph
Paths and cycles (05C38) Edge subsets with special properties (factorization, matching, partitioning, covering and packing, etc.) (05C70)
Cites Work
- Unnamed Item
- Binding numbers and connected factors
- Graph factors and factorization: 1985--2003: a survey
- Binding numbers and \(f\)-factors of 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
- Binding number conditions for matching extension
- Packing paths of length at least two
- Toughness and isolated toughness conditions for \(P_{\ge 3}\)-factor uniform graphs
- The existence of path-factor covered graphs
- On path-factor critical deleted (or covered) graphs
- Path factors in subgraphs
- Some existence theorems on path factors with given properties in graphs
- \(P_3\)-factors in the square of a tree
- Graph Factors and Matching Extensions
- Some degree conditions for 𝒫≥k-factor covered graphs
- The binding number of a graph and its Anderson number
- The Factors of Graphs
- TOUGHNESS, ISOLATED TOUGHNESS AND PATH FACTORS IN GRAPHS
- Path factors and neighborhoods of independent sets in graphs
This page was built for publication: Binding number and path-factor critical deleted graphs