Path-factor critical covered graphs and path-factor uniform graphs
From MaRDI portal
Recommendations
- The existence of path-factor uniform graphs with large connectivity
- Some sufficient conditions for path-factor uniform graphs
- Degree conditions for path-factor critical deleted or covered graphs
- Some existence theorems on path factors with given properties in 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 neighborhood union condition for fractional \((a, b, k)\)-critical covered graphs
- A Note of Generalization of Fractional ID-factor-critical Graphs
- A note on fractional ID-\( [ a , b ]\)-factor-critical covered 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
- Characterizations for \({\mathcal{P}}_{\geq 2}\)-factor and \({\mathcal{P}}_{\geq 3}\)-factor covered graphs
- Component factors with large components in graphs
- Degree sum conditions for path-factors with specified end vertices in bipartite 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 and path-factor uniform graphs. II.
- Isolated toughness for path factors in networks
- Minimum degree, independence number and pseudo \([2, b]\)-factors in graphs
- On k-orthogonal factorizations in networks
- On path factors of \((3,4)\)-biregular bigraphs
- On path-factor critical deleted (or covered) graphs
- Packing 3-vertex paths in claw-free graphs and related topics
- Path and cycle factors of cubic bipartite graphs
- Path factors and neighborhoods of independent sets in graphs
- Path factors in subgraphs
- Path factors of bipartite graphs
- Research on fractional critical covered graphs
- Some degree conditions for \(\mathcal{P}_{\geq k}\)-factor covered graphs
- Sufficient condition for the existence of an even \([a,b]\)-factor in graph
- Sufficient conditions for the existence of a path-factor which are related to odd components
- The existence of path-factor uniform graphs with large connectivity
- Toughness, isolated toughness and path factors in graphs
Cited in
(20)- Two Sufficient Conditions for Graphs to Admit Path Factors
- The A_-spectral radius for path-factors in 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
- Tight toughness bounds for path-factor critical avoidable 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
- Tight toughness, isolated toughness and binding number bounds for \(( \mathscr{A},n) \)-critical deleted graphs
- The path-factors and generalized distance spectral radius of graphs
- Some results on the k-strong parity property in a graph
- Some sufficient conditions for graphs to have component factors
- A spectral condition for the existence of component factors in graphs
- Toughness, fractional extendability and distance spectral radius in graphs
- Characterizing path-factor deleted graphs via \(Q\)-index and \(\mathcal{D}\)-index
This page was built for publication: Path-factor critical covered graphs and path-factor uniform graphs
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6186581)
