Sizhong Zhou

From MaRDI portal
Person:1753363

Available identifiers

zbMath Open zhou.sizhongMaRDI QIDQ1753363

List of research outcomes





PublicationDate of PublicationType
An odd \([1, b]\)-factor in a graph from signless Laplacian spectral radius2025-01-20Paper
Star-factors with large components, fractional \(k\)-extendability and spectral radius in graphs2025-01-06Paper
A spectral condition for a graph to have strong parity factors2024-12-04Paper
Some results about star-factors in graphs2024-11-20Paper
Spanning \(k\)-trees and distance signless Laplacian spectral radius of graphs2024-09-26Paper
On fractional ID-\((g,f)\)-factor-critical covered graphs.2024-08-07Paper
Distance signless Laplacian spectral radius for the existence of path-factors in graphs2024-06-27Paper
Remarks on restricted fractional \((g, f)\)-factors in graphs2024-06-20Paper
Two Sufficient Conditions for Graphs to Admit Path Factors2024-04-11Paper
\(\mathcal{D}\)-index and \(\mathcal{Q}\)-index for spanning trees with leaf degree at most \(k\) in graphs2024-03-27Paper
The \(A_\alpha\)-spectral radius for path-factors in graphs2024-03-27Paper
Sufficient conditions for graphs to have strong parity factors2024-01-22Paper
Some results about ID-path-factor critical graphs2023-12-12Paper
https://portal.mardi4nfdi.de/entity/Q60614752023-12-08Paper
Characterizing an odd [1, b]-factor on the distance signless Laplacian spectral radius2023-09-19Paper
Sufficient conditions for fractional [a,b]-deleted graphs2023-09-17Paper
Isolated toughness and path-factor uniform graphs. II.2023-08-14Paper
https://portal.mardi4nfdi.de/entity/Q61608942023-06-02Paper
Path factors and neighborhoods of independent sets in graphs2023-05-12Paper
Some sufficient conditions for path-factor uniform graphs2023-04-26Paper
Spanning k-trees and distance spectral radius in graphs2023-04-18Paper
Some existence theorems on path-factor critical avoidable graphs2023-04-03Paper
Signless Laplacian spectral radius for a k-extendable graph2023-03-29Paper
Two sufficient conditions for odd \([1,b]\)-factors in graphs2023-02-01Paper
Some results on path-factor critical avoidable graphs2022-12-02Paper
A neighborhood union condition for fractional \((a, b, k)\)-critical covered graphs2022-11-02Paper
A Note of Generalization of Fractional ID-factor-critical Graphs2022-10-31Paper
Toughness, isolated toughness and path factors in graphs2022-09-19Paper
Independence number and connectivity for fractional \((a, b, k)\)-critical covered graphs2022-09-15Paper
The existence of path-factor uniform graphs with large connectivity2022-09-15Paper
https://portal.mardi4nfdi.de/entity/Q51006272022-09-01Paper
A note on fractional ID-\( [ a , b ]\)-factor-critical covered graphs2022-08-04Paper
Path factors in subgraphs2022-08-04Paper
On path-factor critical deleted (or covered) graphs2022-07-15Paper
Nowhere-zero unoriented 6-flows on certain triangular graphs2022-07-01Paper
Component factors and binding number conditions in graphs2022-05-30Paper
The existence of subdigraphs with orthogonal factorizations in digraphs2022-04-26Paper
Some sufficient conditions for path-factor uniform graphs2022-04-20Paper
Discussions on orthogonal factorizations in digraphs2022-04-14Paper
A Fan-type result for the existence of restricted fractional \((g, f)\)-factors2022-03-22Paper
Binding numbers for fractional \((a, b, k)\)-critical covered graphs2022-03-22Paper
On \(P_{\geq 3}\)-factor deleted graphs2022-03-15Paper
All fractional \([a,b]\)-factors with prescribed properties.2021-12-10Paper
Nash-Williams conditions for the existence of all fractional \([a,b]\)-factors2021-11-10Paper
A result on fractional \((a,b,k)\)-critical covered graphs2021-11-04Paper
Binding numbers and restricted fractional \(( g , f )\)-factors in graphs2021-10-21Paper
A result on restricted fractional \((g,f)\)-factors in graphs2021-09-03Paper
Notes on fractional \((a, b, k)\)-critical covered graphs2021-09-03Paper
Isolated toughness and path-factor uniform graphs2021-07-19Paper
The existence of fractional \((g,f)\)-factors in networks2021-05-25Paper
Degree conditions for \(k\)-Hamiltonian \([a,b]\)-factors2021-05-11Paper
Remarks on path factors in graphs2021-05-10Paper
Isolated toughness and \(k\)-Hamiltonian \([a,b]\)-factors2021-05-03Paper
A neighborhood condition for graphs to have restricted fractional (g,f)-factors2021-04-27Paper
Isolated toughness and \(P_{\ge 3}\)-factors in graphs2020-11-12Paper
All fractional \((g,f)\)-factors in graphs2020-10-13Paper
Subgraphs with orthogonal factorizations in graphs2020-09-17Paper
Some existence theorems on path factors with given properties in graphs2020-09-16Paper
Sun toughness and \(P_{\geq3}\)-factors in graphs2020-07-22Paper
Binding number conditions for \(P_{\geq 2}\)-factor and \(P_{\geq 3}\)-factor uniform graphs2020-01-22Paper
A sufficient condition for graphs to have ID-Hamiltonian \([a,b]\)-factors2019-12-18Paper
An improvement and generalization of all fractional factors in graphs2019-12-18Paper
On ID-Hamiltonian \([a,b]\)-factor2019-12-18Paper
Some results about component factors in graphs2019-11-06Paper
Degree conditions for fractional \((a,b,k)\)-critical covered graphs2019-10-10Paper
Remarks on fractional ID-\(k\)-factor-critical graphs2019-07-26Paper
An existence theorem on Hamiltonian \((g,f)\)-factors in networks2019-07-22Paper
A note of generalization of fractional ID-factor-critical graphs2019-07-19Paper
Neighborhood conditions for fractional ID-\(k\)-factor-critical graphs2018-09-18Paper
Randomly orthogonal factorizations with constraints in bipartite networks2018-08-24Paper
Some existence theorems on all fractional \((g,f)\)-factors with prescribed properties2018-05-29Paper
A generalization of orthogonal factorizations in digraphs2018-03-16Paper
Toughness for the existence of \(k\)-Hamiltonian \([a,b]\)-factors.2018-02-09Paper
A sufficient condition for the existence of a \(k\)-factor excluding a given \(r\)-factor2017-12-14Paper
The existence of \(P_{\geq3}\)-factor covered graphs2017-10-13Paper
Randomly orthogonal factorizations in networks2017-10-12Paper
A result on \(r\)-orthogonal factorizations in digraphs2017-08-31Paper
Independence number, connectivity and fractional \((g,f)\)-factors in graphs2017-07-19Paper
An existence theorem on fractional \((g, f, n)\)-critical graphs2017-07-05Paper
Binding numbers for all fractional \((a,b,k)\)-critical graphs2017-04-11Paper
Stability number and \(k\)-Hamiltonian \([a,b]\)-factors2017-04-07Paper
Subgraphs with orthogonal \([0,k_{i}]_{1}^{n}\)-factorizations in graphs2017-04-07Paper
An existence theorem on fractional deleted graphs2016-11-25Paper
Binding numbers and fractional \((g,f,n)\)-critical graphs2016-11-02Paper
https://portal.mardi4nfdi.de/entity/Q57403122016-07-26Paper
Binding number and minimum degree for fractional ID-\(k\)-fractor-critical graphs2016-07-20Paper
https://portal.mardi4nfdi.de/entity/Q57410152016-07-20Paper
A neighborhood condition for graphs to have \([a,b]\)-factors excluding a given subgraph2016-06-10Paper
A new sufficient condition for graphs to be \((a,b,k)\)-critical graphs.2016-05-04Paper
Degree conditions for graphs to be fractional \(k\)-covered graphs.2016-05-04Paper
A neighborhood condition for fractional ID-\([a,b]\)-factor-critical graphs2016-04-25Paper
A result on the existence of fractional \(k\)-factors in graphs2015-08-05Paper
A result on \((a,b,k)\)-critical graphs.2015-04-13Paper
\([a,b]\)-factors with given edges in graphs.2015-04-13Paper
Neighborhood conditions for the existence of fractional \(k\)-factors with prescribed properties2015-02-16Paper
Remarks on orthogonal factorizations of digraphs2014-11-28Paper
Isolated toughness and fractional \((g,f)\)-factors of graphs.2014-09-19Paper
A result on fractional ID-\([a,b]\)-factor-critical graphs2014-08-15Paper
Independence number and connectivity for fractional ID-\(k\)-factor-critical graphs2014-08-12Paper
https://portal.mardi4nfdi.de/entity/Q54198302014-06-11Paper
Binding numbers and fractional \((g,f)\)-deleted graphs2014-06-11Paper
On all fractional \({(a,b,k)}\)-critical graphs2014-06-03Paper
Subdigraphs with orthogonal factorizations of digraphs. II2014-03-25Paper
Binding numbers for fractional ID-\(k\)-factor-critical graphs2014-03-18Paper
A result on fractional ID-\(k\)-factor-critical graphs2014-03-12Paper
Note on connected \((g, f)\)-factors of graphs2014-03-12Paper
Two results on the existence of \([a,b]\)-factors in graphs2014-02-28Paper
Minimum degree, independence number and \((a,b,k)\)-critical graphs2014-02-19Paper
Stability number and minimum degree for (\(a, b, k\))-critical graphs2014-01-28Paper
An isolated toughness condition for graphs to be fractional \((a, b, k)\)-critical graphs2014-01-21Paper
A degree condition for graphs to have \((g,f)\)-factors.2013-12-06Paper
Remarks on neighborhoods of independent sets and \((a,b,k)\)-critical graphs2013-10-24Paper
Toughness and the existence of Hamiltonian \([a, b]\)-factors of graphs2013-09-26Paper
A new sufficient condition for graphs to have \((g,f)\)-factors.2013-09-09Paper
Orthogonal \((g,f)\)-factorization in graphs.2013-09-09Paper
On fractional \((k,m)\)-deleted graphs2013-07-12Paper
A toughness condition for fractional \((k,m)\)-deleted graphs2013-06-28Paper
Toughness and \((a,b,k)\)-critical graphs2013-03-28Paper
https://portal.mardi4nfdi.de/entity/Q48981552012-12-29Paper
Independence number and minimum degree for fractional ID-\(k\)-factor-critical graphs2012-11-21Paper
Binding number and fractional \(k\)-factors of graphs.2012-11-15Paper
Some new sufficient conditions for graphs to be \((a,b,k)\)-critical graphs.2012-11-15Paper
A MINIMUM DEGREE CONDITION FOR FRACTIONAL ID-[a,b]-FACTOR-CRITICAL GRAPHS2012-11-02Paper
A binding number condition for graphs to be \((a, b, k)\)-critical graphs2012-08-10Paper
Binding number and minimum degree for the existence of fractional \(k\)-factors with prescribed properties2012-07-02Paper
A new neighborhood condition for graphs to be fractional \((k,m)\)-deleted graphs2012-06-14Paper
A Fan-type condition for the existence of \([a,b]\)-factors2012-06-01Paper
Randomly \(r\)-orthogonal \((0,f)\)-factorizations of bipartite \((0,mf-(m-1)r)\)-graphs.2012-03-01Paper
Binding number and minimum degree for fractional \((k,m)\)-deleted graphs2012-02-10Paper
Minimum degree conditions for graphs to be \((g,f,n)\)-critical graphs2011-12-24Paper
Binding numbers and \([a,b]\)-factors excluding a given \(k\)-factor2011-11-02Paper
https://portal.mardi4nfdi.de/entity/Q31717972011-10-05Paper
A sufficient condition for graphs to be fractional \((k,m)\)-deleted graphs2011-06-28Paper
A remark about fractional \((f,n)\)-critical graphs2011-06-23Paper
https://portal.mardi4nfdi.de/entity/Q30092512011-06-23Paper
Degree conditions and fractional \(k\)-factors of graphs2011-04-28Paper
Some new sufficient conditions for graphs to have fractional \(k\)-factors2011-04-06Paper
Randomly orthogonal factorizations of bipartite graphs2011-03-01Paper
A neighborhood condition for the existence of \([a,b]\)-factors2011-02-05Paper
A sufficient condition for a graph to be an (a, b, k)-critical graph2010-11-12Paper
https://portal.mardi4nfdi.de/entity/Q30525782010-11-05Paper
https://portal.mardi4nfdi.de/entity/Q35816722010-09-02Paper
On fractional \((f,n)\)-critical graphs2010-08-20Paper
A sufficient condition for graphs to be \( (g,f,k)\)-critical graphs2010-07-08Paper
https://portal.mardi4nfdi.de/entity/Q35717872010-07-08Paper
A New Sufficient Condition for a Graph To Be (g, f, n)-Critical2010-06-21Paper
Neighbourhood and the existence of fractional \(k\)-factors of graphs2010-05-26Paper
A sufficient condition for a graph to be a fractional \((f,n)\)-critical graph2010-05-26Paper
A result on fractional \(k\)-deleted graphs2010-03-18Paper
Binding numbers of graphs and the existence of \([a,b]\)-factors2010-02-12Paper
A neighbourhood condition for graphs to be fractional \((k,m)\)-deleted graphs2010-01-12Paper
A result on \((g,f,n)\)-critical graphs2010-01-12Paper
Independence number, connectivity and \((a,b,k)\)-critical graphs2009-12-09Paper
A minimum degree condition of fractional \((k,m)\)-deleted graphs2009-11-25Paper
2-orthogonal \( (0,f)\)-factorizations of graphs2009-11-11Paper
A degree condition for graphs to have connected \((g,f)\)-factors2009-09-16Paper
A sufficient condition for graphs to be \((g,f)\)-deleted graph2009-07-22Paper
Binding number conditions for fractional \(k\)-deleted graphs2009-07-22Paper
Some results on fractional \(k\)-factors2009-07-06Paper
RANDOMLY ORTHOGONAL FACTORIZATIONS OF (0,mf - (m - 1)r)-GRAPHS2009-02-12Paper
Neighborhood conditions and fractional \(k\)-factors2009-01-29Paper
\( (g,f)\)-factors of graphs with prescribed properties2008-11-24Paper
More sufficient conditions for a graph to have \((g,f)\)-factors2008-11-03Paper
Some sufficient conditions on \( (g, f)\)-\(k\)-uniform graphs2008-08-06Paper
NEIGHBOURHOODS OF INDEPENDENT SETS FOR (a,b,k)-CRITICAL GRAPHS2008-07-23Paper
BINDING NUMBER CONDITIONS FOR (a, b, k)-CRITICAL GRAPHS2008-07-21Paper
Randomly \(r\)-orthogonal \((0,f )\)-factorizations of \((0, mf-m+1)\)-graphs2008-02-22Paper
Notes on the binding numbers for (a, b, k)-critical graphs2008-01-23Paper
The binding numbers of graphs and fractional \(n\)-edge (vertex) deleted graphs2008-01-14Paper
https://portal.mardi4nfdi.de/entity/Q54328622007-12-18Paper
Complete-factors and \((g,f)\)-covered graphs2007-07-26Paper
Some sufficient conditions for graphs to have (g, f)-factors2007-07-12Paper
Neighborhood union for \([a,b]\)-\(k\)-uniform graphs2007-04-19Paper
https://portal.mardi4nfdi.de/entity/Q34284922007-03-27Paper
Binding numbers of graphs and existence of fractional factors2007-01-16Paper
https://portal.mardi4nfdi.de/entity/Q54851562006-08-29Paper
https://portal.mardi4nfdi.de/entity/Q54766232006-07-17Paper
Orthogonal \((g,f)\)-factorizations of bipartite \((mg+k-1,mf-k+1)\)-graphs2006-05-26Paper
On \((g,f)\)-2-covered graphs and \((g,f)\)-2-deleted graphs2006-05-24Paper
On \((g,f)\)-deleted and \((g,f)\)-2-deleted bipartite graphs2006-03-13Paper
https://portal.mardi4nfdi.de/entity/Q33726582006-03-09Paper
https://portal.mardi4nfdi.de/entity/Q33679742006-01-27Paper
https://portal.mardi4nfdi.de/entity/Q46698532005-04-15Paper
https://portal.mardi4nfdi.de/entity/Q46698702005-04-15Paper
https://portal.mardi4nfdi.de/entity/Q46534142005-03-07Paper
https://portal.mardi4nfdi.de/entity/Q48062622003-10-13Paper
https://portal.mardi4nfdi.de/entity/Q44392542003-01-01Paper
Spectral radius and k-factor-critical graphsN/APaper
A spectral condition for a graph having a strong parity factorN/APaper
Toughness and A{\alpha}-spectral radius in graphsN/APaper
A{\alpha}-spectral radius and path-factor covered graphsN/APaper

Research outcomes over time

This page was built for person: Sizhong Zhou