Degree sum conditions for path-factor uniform graphs
From MaRDI portal
Publication:6669307
DOI10.1007/S13226-023-00446-7MaRDI QIDQ6669307
Publication date: 22 January 2025
Published in: Indian Journal of Pure \& Applied Mathematics (Search for Journal in Brave)
Could not fetch data.
Paths and cycles (05C38) Edge subsets with special properties (factorization, matching, partitioning, covering and packing, etc.) (05C70)
Cites Work
- Title not available (Why is that?)
- Title not available (Why is that?)
- Factors and factorizations of graphs. Proof techniques in factor theory
- On factors with given components
- 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
- 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
- Binding number conditions for \(P_{\geq 2}\)-factor and \(P_{\geq 3}\)-factor uniform graphs
- The existence of \(P_{\geq3}\)-factor covered graphs
- \(P_3\)-factors in the square of a tree
- On packing 3-vertex paths in a graph
- Sun toughness and $P_{\geq3}$-factors in graphs
- Graph Factors and Matching Extensions
- Path factors in cubic graphs
- Factors and factorizations of graphs—a survey
- Path factors of bipartite graphs
- Sufficient conditions for the existence of a path‐factor which are related to odd components
- Some degree conditions for 𝒫≥k-factor covered graphs
- Remarks on component factors in graphs
- Sufficient conditions for graphs with {P2, P5}-factors
- The existence of path-factor uniform graphs with large connectivity
- Some results about component factors in graphs
- The Factors of Graphs
- TOUGHNESS, ISOLATED TOUGHNESS AND PATH FACTORS IN GRAPHS
- Partitioning vertices of 1-tough graphs into paths
- Path factors in claw-free graphs
- Remarks on component factors
- Path factors and neighborhoods of independent sets in graphs
- Binding number and path-factor critical deleted 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)
