On path-factor critical uniform graphs
From MaRDI portal
Publication:6669293
DOI10.1007/s13226-023-00428-9MaRDI QIDQ6669293
Publication date: 22 January 2025
Published in: Indian Journal of Pure \& Applied Mathematics (Search for Journal in Brave)
binding number\(P_{\geq 3}\)-factor\(P_{\geq 2}\)-factor\((P_{\geq 2}, n)\)-critical uniform graph\((P_{\geq 3}, n)\)-critical uniform graph
Paths and cycles (05C38) Edge subsets with special properties (factorization, matching, partitioning, covering and packing, etc.) (05C70)
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Packing 3-vertex paths in claw-free graphs and related topics
- Component factors with large components in graphs
- Characterizations for \({\mathcal{P}}_{\geq 2}\)-factor and \({\mathcal{P}}_{\geq 3}\)-factor covered 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
- Packing paths of length at least two
- A neighborhood union condition for fractional \((a, b, k)\)-critical covered graphs
- On \(P_{\geq 3}\)-factor deleted graphs
- 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
- A result on fractional \((a,b,k)\)-critical covered graphs
- Binding number conditions for \(P_{\geq 2}\)-factor and \(P_{\geq 3}\)-factor uniform graphs
- Two sufficient conditions for odd \([1,b\)-factors in graphs]
- Some sufficient conditions for path-factor uniform graphs
- [https://portal.mardi4nfdi.de/wiki/Publication:4242796 An El-Zah�r type condition ensuring path-factors]
- Sufficient conditions for the existence of a path‐factor which are related to odd components
- Isolated toughness for path factors in networks
- The existence of path-factor uniform graphs with large connectivity
- The binding number of a graph and its Anderson number
- TOUGHNESS, ISOLATED TOUGHNESS AND PATH FACTORS IN GRAPHS
- Partitioning vertices of 1-tough graphs into paths
- Binding number and path-factor critical deleted graphs
- Path-factor critical covered graphs and path-factor uniform graphs
- Remarks on restricted fractional \((g, f)\)-factors in graphs
This page was built for publication: On path-factor critical uniform graphs