Binding number conditions for P_ 2-factor and P_ 3-factor uniform graphs
From MaRDI portal
Publication:2286579
For a graph $G$, a spanning subgraph $F$ of $G$ is called a $P_{\geq k}$-factor of $G$ if each component of $F$ is a path of order at least $k$, where $k\geq 2$ is an integer. The authors introduce the concept of $P_{\geq k}$-factor uniform graph, which is a graph such that for any two distinct edges $e$ and $f$ of the graph, it admits a $P_{\geq k}$-factor which includes $e$ but excludes $f$. In this paper, the authors use the graph parameter binding number to give sufficient conditions for a graph to be $P_{\geq 2}$-factor uniform and $P_{\geq 3}$-factor uniform, respectively.
Recommendations
- Toughness and isolated toughness conditions for \(P_{\ge 3}\)-factor uniform graphs
- The existence of path-factor uniform graphs with large connectivity
- Tight binding number bound for \(P_{\geq 3}\)-factor uniform graphs
- Some sufficient conditions for path-factor uniform graphs
- Isolated toughness and path-factor uniform graphs. II.
Cites work
- 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 \(m\)-near-factor-critical graphs
- A result on r-orthogonal factorizations in digraphs
- An isolated toughness condition for graphs to be fractional (k, m)-deleted graphs
- Characterization of forbidden subgraphs for the existence of even factors in a graph
- Characterizations for \({\mathcal{P}}_{\geq 2}\)-factor and \({\mathcal{P}}_{\geq 3}\)-factor covered graphs
- Generalizations of marriage theorem for degree factors
- scientific article; zbMATH DE number 3720956 (Why is no real title available?)
- Neighborhood conditions for fractional ID-k-factor-critical graphs
- Packing paths of length at least two
- Remarks on fractional ID-\(k\)-factor-critical graphs
- Remarks on orthogonal factorizations of digraphs
- Some existence theorems on all fractional (g,f)-factors with prescribed properties
- Some results about component factors in graphs
- Two tight independent set conditions for fractional (g,f,m)-deleted graphs systems
Cited in
(33)- Isolated toughness and \(k\)-Hamiltonian \([a,b]\)-factors
- Degree conditions for \(k\)-Hamiltonian \([a,b]\)-factors
- Sun toughness conditions for \(P_2\) and \(P_3\) factor uniform and factor critical avoidable graphs
- Toughness and isolated toughness conditions for \(P_{\ge 3}\)-factor uniform graphs
- Some results on path-factor critical avoidable graphs
- The existence of subdigraphs with orthogonal factorizations in digraphs
- A degree condition for fractional (g, f, n)-critical covered graphs
- A note on fractional ID-\( [ a , b ]\)-factor-critical covered graphs
- Research on fractional critical covered graphs
- A sufficient condition for the existence of restricted fractional (g, f)-factors in graphs
- Tight binding number bound for \(P_{\geq 3}\)-factor uniform graphs
- Binding numbers and restricted fractional ( g , f )-factors in graphs
- Toughness for fractional \((2, b, k)\)-critical covered graphs
- Some sufficient conditions for path-factor uniform graphs
- A neighborhood condition for graphs to have restricted fractional (g,f)-factors
- The existence of path-factor uniform graphs with large connectivity
- Some results about component factors in graphs
- scientific article; zbMATH DE number 7774082 (Why is no real title available?)
- Binding number for path-factor uniform graphs
- Remarks on component factors
- Characterizing \(\mathcal{P}_{\geqslant 2}\)-factor deleted graphs with respect to the size or the spectral radius
- Sun toughness and path-factor uniform graphs
- Path-factor critical covered graphs and path-factor uniform graphs
- On fractional (g, f, n^, m)-critical covered graphs
- Sufficient conditions for a graph \(kG\) admitting all \([1, k]\)-factors
- Binding number, odd \([1, b]\)-factors and the distance spectral radius
- On path-factor critical uniform graphs
- Degree sum conditions for path-factor uniform graphs
- The path-factors and generalized distance spectral radius of graphs
- Characterizing path-factor uniform graphs with respect to the degree sum of non-adjacent vertices
- Tight toughness, isolated toughness and binding number bounds for the \(\{K_2, C_n\}\)-factors
- Binding number conditions for path-factor uniform graphs
- Two sufficient conditions for component factors in graphs
This page was built for publication: Binding number conditions for \(P_{\geq 2}\)-factor and \(P_{\geq 3}\)-factor uniform graphs
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2286579)
