Isolated toughness and path-factor uniform graphs. II.
From MaRDI portal
Recommendations
- Isolated toughness and path-factor uniform graphs
- Toughness and isolated toughness conditions for \(P_{\ge 3}\)-factor uniform graphs
- The existence of path-factor uniform graphs with large connectivity
- Some sufficient conditions for path-factor uniform graphs
- Toughness and isolated toughness conditions for path-factor critical covered 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 result on fractional \((a,b,k)\)-critical covered graphs
- An El-Zah�r type condition ensuring path-factors
- An extension of Tutte's 1-factor theorem
- 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
- Fractional (g,f)-factors in graphs
- Graph factors and factorization: 1985--2003: a survey
- Isolated toughness and path-factor uniform graphs
- On \(P_{\geq 3}\)-factor deleted graphs
- On path factors of \((3,4)\)-biregular bigraphs
- On path-factor critical deleted (or covered) graphs
- Packing paths of length at least two
- Path and cycle factors of cubic bipartite graphs
- Path factors and neighborhoods of independent sets in graphs
- Path factors and parallel knock-out schemes of almost claw-free graphs
- Path factors in claw-free graphs
- Path factors in subgraphs
- Remarks on path factors in graphs
- Some results on path-factor critical avoidable graphs
- The existence of a path-factor without small odd paths
- Tight binding number bound for \(P_{\geq 3}\)-factor uniform graphs
- Toughness, isolated toughness and path factors in graphs
Cited in
(18)- Toughness and isolated toughness conditions for \(P_{\ge 3}\)-factor uniform 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
- Some sufficient conditions for path-factor uniform graphs
- Isolated toughness and path-factor uniform graphs
- A Note of Generalization of Fractional ID-factor-critical Graphs
- Isolated toughness for path factors in networks
- The existence of path-factor uniform graphs with large connectivity
- Two Sufficient Conditions for Graphs to Admit Path Factors
- Sun toughness and path-factor uniform graphs
- Path-factor critical covered graphs and 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
- A spectral condition for component factors in graphs
- An odd \([1, b]\)-factor in a graph from signless Laplacian spectral radius
- Degree sum conditions for path-factor uniform graphs
- A spectral condition for the existence of component factors in graphs
- The existence of \(\{P_2,P_5\}\)-factors in graphs
This page was built for publication: Isolated toughness and path-factor uniform graphs. II.
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6114133)
