Some results on path-factor critical avoidable graphs
DOI10.7151/DMGT.2364zbMATH Open1504.05236OpenAlexW3092050107MaRDI QIDQ2107757FDOQ2107757
Authors: Sizhong Zhou 
Publication date: 2 December 2022
Published in: Discussiones Mathematicae Graph Theory (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.7151/dmgt.2364
Recommendations
toughnessisolated toughness\((P_{ \geq k}, n)\)-factor critical avoidable graph\(P_{\geq k}\)-factor
Deterministic network models in operations research (90B10) Paths and cycles (05C38) Edge subsets with special properties (factorization, matching, partitioning, covering and packing, etc.) (05C70)
Cites Work
- Tough graphs and Hamiltonian circuits.
- 1-factor covers of regular graphs
- Component factors with large components in 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
- An extension of Tutte's 1-factor theorem
- Packing 3-vertex paths in claw-free graphs and related topics
- Toughness and the existence ofk-factors
- Toughness of graphs and the existence of factors
- Fractional \((g,f)\)-factors in graphs
- Remarks on path factors in graphs
- Subgraphs with orthogonal factorizations in graphs
- Some existence theorems on path factors with given properties in graphs
- Sufficient conditions for the existence of a path-factor which are related to odd components
- Remarks on orthogonal factorizations of digraphs
- Degree conditions for fractional \((a,b,k)\)-critical covered graphs
- Research on fractional critical covered graphs
- A sufficient condition for the existence of restricted fractional \((g, f)\)-factors in graphs
- Binding number conditions for \(P_{\geq 2}\)-factor and \(P_{\geq 3}\)-factor uniform graphs
- A toughness condition for fractional \((k, m)\)-deleted graphs revisited
- Binding numbers for fractional \((a, b, k)\)-critical covered graphs
- An isolated toughness condition for graphs to be fractional (\(k, m\))-deleted graphs
- A toughness condition for fractional \((k,m)\)-deleted graphs
Cited In (28)
- \(\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
- A result on fractional \((a,b,k)\)-critical covered graphs
- Remarks on component factors
- Sufficient conditions for graphs to have strong parity factors
- Degree conditions for \(k\)-Hamiltonian \([a,b]\)-factors
- Toughness for fractional \((2, b, k)\)-critical covered graphs
- Binding numbers and restricted fractional \(( g , f )\)-factors in graphs
- Spanning \(k\)-trees and distance signless Laplacian spectral radius of graphs
- Some results about ID-path-factor critical graphs
- Path factors and neighborhoods of independent sets in graphs
- Some existence theorems on path-factor critical avoidable graphs
- Independence number and minimum degree for path-factor critical uniform graphs
- Two sufficient conditions for odd \([1,b]\)-factors in graphs
- A neighborhood condition for graphs to have restricted fractional (g,f)-factors
- Tight toughness bounds for path-factor critical avoidable graphs
- Characterizing spanning trees via the size or the spectral radius of graphs
- Star-factors with large components, fractional \(k\)-extendability and spectral radius in graphs
- A spectral condition for component factors in graphs
- Avoidable paths in graphs
- An odd \([1, b]\)-factor in a graph from signless Laplacian spectral radius
- Isolated toughness and path-factor uniform graphs. II.
- On path-factor critical deleted (or covered) graphs
- A note on fractional ID-\( [ a , b ]\)-factor-critical covered graphs
- A neighborhood union condition for fractional \((a, b, k)\)-critical covered graphs
- Path factors in subgraphs
- Two Sufficient Conditions for Graphs to Admit Path Factors
- Degree conditions for the existence of a {P2, P5}-factor in a graph
This page was built for publication: Some results on path-factor critical avoidable graphs
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2107757)
