Some sufficient conditions for path-factor uniform graphs
From MaRDI portal
Recommendations
- The existence of path-factor uniform graphs with large connectivity
- Isolated toughness and path-factor uniform graphs. II.
- Toughness and isolated toughness conditions for \(P_{\ge 3}\)-factor uniform graphs
- Binding number conditions for \(P_{\geq 2}\)-factor and \(P_{\geq 3}\)-factor uniform graphs
- Isolated toughness and path-factor uniform graphs
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 neighborhood condition for graphs to have restricted fractional (g,f)-factors
- A neighborhood union condition for fractional \((a, b, k)\)-critical covered graphs
- A note on fractional ID-\( [ a , b ]\)-factor-critical covered graphs
- A result on fractional \((a,b,k)\)-critical covered graphs
- An El-Zah�r type condition ensuring path-factors
- Binding number conditions for \(P_{\geq 2}\)-factor and \(P_{\geq 3}\)-factor uniform graphs
- Characterizations for \({\mathcal{P}}_{\geq 2}\)-factor and \({\mathcal{P}}_{\geq 3}\)-factor covered graphs
- Component factors with large components in graphs
- Discussions on orthogonal factorizations in digraphs
- Independence number and connectivity for fractional \((a, b, k)\)-critical covered graphs
- Independence number, connectivity and all fractional \((a, b, k)\)-critical graphs
- Isolated toughness for path factors in networks
- Neighborhood unions and factor critical graphs
- On k-orthogonal factorizations in networks
- On factors with given components
- On path-factor critical deleted (or covered) graphs
- Partitioning vertices of 1-tough graphs into paths
- Path and cycle factors of cubic bipartite graphs
- Path factors and neighborhoods of independent sets in graphs
- Path factors in subgraphs
- Research on fractional critical covered graphs
- Star-factors with large components
- Tight binding number bound for \(P_{\geq 3}\)-factor uniform graphs
- Toughness and isolated toughness conditions for \(P_{\ge 3}\)-factor uniform graphs
- Toughness, isolated toughness and path factors in graphs
- Two sufficient conditions for odd \([1,b]\)-factors in graphs
Cited in
(37)- On factors of uniform intersection 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
- Some existence theorems on path factors with given properties in graphs
- Tight binding number bound for \(P_{\geq 3}\)-factor uniform graphs
- Binding number conditions for \(P_{\geq 2}\)-factor and \(P_{\geq 3}\)-factor uniform graphs
- An independent number condition for the existence of \(k\)-uniform graphs
- The existence of path-factor uniform graphs with large connectivity
- scientific article; zbMATH DE number 7774082 (Why is no real title available?)
- Binding number for path-factor uniform graphs
- Some results about ID-path-factor critical graphs
- Isolated toughness and path-factor uniform graphs. II.
- Two Sufficient Conditions for Graphs to Admit Path Factors
- Degree conditions for the existence of a {P2, P5}-factor in a graph
- Sufficient conditions for graphs to have strong parity factors
- 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_-spectral radius for path-factors in graphs
- Some sufficient conditions for path-factor uniform graphs
- Distance signless Laplacian spectral radius for the existence of path-factors in graphs
- Spanning k-trees and distance signless Laplacian spectral radius of graphs
- Independence number and minimum degree for path-factor critical uniform graphs
- Some results about star-factors in graphs
- Star-factors with large components, fractional k-extendability and spectral radius in graphs
- Characterizing spanning trees via the size or the spectral radius of graphs
- A spectral condition for component factors in graphs
- Degree conditions for path-factors in graphs
- An odd \([1, b]\)-factor in a graph from signless Laplacian 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
- A spectral condition for the existence of component factors in graphs
- A distance spectral radius for star-factors with large components in graphs
- Spectral conditions for component factors in graphs involving minimum degree
- Characterizing path-factor deleted graphs via \(Q\)-index and \(\mathcal{D}\)-index
- Some spectral conditions for star-factors in bipartite graphs
- Laplacian eigenvalue condition for a graph to have the strong parity property
This page was built for publication: Some sufficient 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 Q2699236)
