Two Sufficient Conditions for Graphs to Admit Path Factors
From MaRDI portal
Publication:6125708
DOI10.3233/fi-242172arXiv2305.18148MaRDI QIDQ6125708
Publication date: 11 April 2024
Published in: Fundamenta Informaticae (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/2305.18148
graphdegree condition\( \mathcal{P}_{\geq 3}\)-factor\(( \mathcal{P}_{\geq 3},k)\)-factor critical graph\(( \mathcal{P}_{\geq 3},m)\)-factor deleted graph
Cites Work
- Unnamed Item
- Component factors with large components in graphs
- An extension of Tutte's 1-factor theorem
- 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
- Some results on path-factor critical avoidable graphs
- On path-factor critical deleted (or covered) graphs
- Two sufficient conditions for odd \([1,b\)-factors in graphs]
- Some sufficient conditions for path-factor uniform graphs
- Remarks on path factors in graphs
- Path and cycle factors of cubic bipartite graphs
- BINDING NUMBERS OF GRAPHS AND THE EXISTENCE OF k-FACTORS
- On k-orthogonal factorizations in networks
- Independence number and connectivity for fractional (a, b, k)-critical covered graphs
- Isolated toughness for path factors in networks
- The binding number of a graph and its Anderson number
- Partitioning vertices of 1-tough graphs into paths
- Isolated toughness and path-factor uniform graphs. II.
- Degree conditions for the existence of a {P2, P5}-factor in a graph
- Path-factor critical covered graphs and path-factor uniform graphs
- \(\mathcal{D}\)-index and \(\mathcal{Q}\)-index for spanning trees with leaf degree at most \(k\) in graphs
- The \(A_\alpha\)-spectral radius for path-factors in graphs
This page was built for publication: Two Sufficient Conditions for Graphs to Admit Path Factors
