Works matching AU Zhou, Sizhong
Results: 38
Some existence theorems on path-factor critical avoidable graphs.
- Published in:
- RAIRO: Operations Research (2804-7303), 2024, v. 58, n. 2, p. 2015, doi. 10.1051/ro/2024071
- By:
- Publication type:
- Article
Sufficient conditions for graphs to have strong parity factors.
- Published in:
- RAIRO: Operations Research (2804-7303), 2023, v. 57, n. 5, p. 2465, doi. 10.1051/ro/2023147
- By:
- Publication type:
- Article
Characterizing an odd [1, b]-factor on the distance signless Laplacian spectral radius.
- Published in:
- RAIRO: Operations Research (2804-7303), 2023, v. 57, n. 3, p. 1343, doi. 10.1051/ro/2023069
- By:
- Publication type:
- Article
The existence of path-factor uniform graphs with large connectivity.
- Published in:
- RAIRO: Operations Research (2804-7303), 2022, v. 56, n. 4, p. 2919, doi. 10.1051/ro/2022143
- By:
- Publication type:
- Article
Independence number and connectivity for fractional (a, b, k)-critical covered graphs.
- Published in:
- RAIRO: Operations Research (2804-7303), 2022, v. 56, n. 4, p. 2535, doi. 10.1051/ro/2022119
- By:
- Publication type:
- Article
A RESULT ON P<sub>≥3</sub>-FACTOR UNIFORM GRAPHS.
- Published in:
- Proceedings of the Romanian Academy, Series A: Mathematics, Physics, Technical Sciences, Information Science, 2022, v. 23, n. 1, p. 3
- By:
- Publication type:
- Article
Isolated toughness for fractional (2,b,k)-critical covered graphs.
- Published in:
- Proceedings of the Romanian Academy, Series A: Mathematics, Physics, Technical Sciences, Information Science, 2023, v. 24, n. 1, p. 11, doi. 10.59277/pra-ser.a.24.1.02
- By:
- Publication type:
- Article
A Fan-type result for the existence of restricted fractional (g, f)-factors.
- Published in:
- Proceedings of the Romanian Academy, Series A: Mathematics, Physics, Technical Sciences, Information Science, 2021, v. 22, n. 1, p. 3
- By:
- Publication type:
- Article
TWO SUFFICIENT CONDITIONS FOR COMPONENT FACTORS IN GRAPHS.
- Published in:
- Discussiones Mathematicae: Graph Theory, 2023, v. 43, n. 3, p. 761, doi. 10.7151/dmgt.2401
- By:
- Publication type:
- Article
Some Results on Path-Factor Critical Avoidable Graphs.
- Published in:
- Discussiones Mathematicae: Graph Theory, 2023, v. 43, n. 1, p. 233, doi. 10.7151/dmgt.2364
- By:
- Publication type:
- Article
NOWHERE-ZERO UNORIENTED 6-FLOWS ON CERTAIN TRIANGULAR GRAPHS.
- Published in:
- Discussiones Mathematicae: Graph Theory, 2022, v. 42, n. 3, p. 727, doi. 10.7151/dmgt.2341
- By:
- Publication type:
- Article
THE EXISTENCE OF P<sub>≥3</sub>-FACTOR COVERED GRAPHS.
- Published in:
- Discussiones Mathematicae: Graph Theory, 2017, v. 37, n. 4, p. 1055, doi. 10.7151/dmgt.1974
- By:
- Publication type:
- Article
A Neighborhood Condition for Fractional ID-[A, B]-Factor-Critical Graphs.
- Published in:
- Discussiones Mathematicae: Graph Theory, 2016, v. 36, n. 3, p. 409, doi. 10.7151/dmgt.1864
- By:
- Publication type:
- Article
A NEIGHBORHOOD CONDITION FOR FRACTIONAL ID-[A,B]-FACTOR-CRITICAL GRAPHS.
- Published in:
- Discussiones Mathematicae: Graph Theory, 2016, v. 36, n. 2, p. 409, doi. 10.7151/dmgt.1864
- By:
- Publication type:
- Article
Individualized Cortical Parcellation Based on Diffusion MRI Tractography.
- Published in:
- Cerebral Cortex, 2020, v. 30, n. 5, p. 3198, doi. 10.1093/cercor/bhz303
- By:
- Publication type:
- Article
Remarks on orthogonal factorizations of digraphs.
- Published in:
- International Journal of Computer Mathematics, 2014, v. 91, n. 10, p. 2109, doi. 10.1080/00207160.2014.881993
- By:
- Publication type:
- Article
Some new sufficient conditions for graphs to have fractional k-factors.
- Published in:
- International Journal of Computer Mathematics, 2011, v. 88, n. 3, p. 484, doi. 10.1080/00207161003681286
- By:
- Publication type:
- Article
A sufficient condition for a graph to be an (a, b, k)-critical graph.
- Published in:
- International Journal of Computer Mathematics, 2010, v. 87, n. 10, p. 2202, doi. 10.1080/00207160902777914
- By:
- Publication type:
- Article
STABILITY NUMBER AND MINIMUM DEGREE FOR (a, b, k)-CRITICAL GRAPHS.
- Published in:
- Discrete Mathematics, Algorithms & Applications, 2013, v. 5, n. 4, p. -1, doi. 10.1142/S1793830913500274
- By:
- Publication type:
- Article
Remarks on path factors in graphs.
- Published in:
- RAIRO: Operations Research (2804-7303), 2020, v. 54, n. 6, p. 1827, doi. 10.1051/ro/2019111
- By:
- Publication type:
- Article
A SUFFICIENT CONDITION FOR A GRAPH TO BE A FRACTIONAL (f, n)-CRITICAL GRAPH.
- Published in:
- Glasgow Mathematical Journal, 2010, v. 52, n. 2, p. 407, doi. 10.1017/S001708951000011X
- By:
- Publication type:
- Article
A NEIGHBOURHOOD CONDITION FOR GRAPHS TO BE FRACTIONAL (k,m)-DELETED GRAPHS.
- Published in:
- Glasgow Mathematical Journal, 2010, v. 52, n. 1, p. 33, doi. 10.1017/S0017089509990139
- By:
- Publication type:
- Article
Distance signless Laplacian spectral radius for the existence of path-factors in graphs.
- Published in:
- Aequationes Mathematicae, 2024, v. 98, n. 3, p. 727, doi. 10.1007/s00010-024-01075-z
- By:
- Publication type:
- Article
Some sufficient conditions for path-factor uniform graphs.
- Published in:
- Aequationes Mathematicae, 2023, v. 97, n. 3, p. 489, doi. 10.1007/s00010-023-00944-3
- By:
- Publication type:
- Article
On path-factor critical deleted (or covered) graphs.
- Published in:
- Aequationes Mathematicae, 2022, v. 96, n. 4, p. 795, doi. 10.1007/s00010-021-00852-4
- By:
- Publication type:
- Article
Some results about component factors in graphs.
- Published in:
- RAIRO -- Operations Research, 2019, v. 53, n. 3, p. 723, doi. 10.1051/ro/2017045
- By:
- Publication type:
- Article
TOUGHNESS, ISOLATED TOUGHNESS AND PATH FACTORS IN GRAPHS.
- Published in:
- Bulletin of the Australian Mathematical Society, 2022, v. 106, n. 2, p. 195, doi. 10.1017/S0004972721000952
- By:
- Publication type:
- Article
A MINIMUM DEGREE CONDITION FOR FRACTIONAL ID-[a,b]-FACTOR-CRITICAL GRAPHS.
- Published in:
- Bulletin of the Australian Mathematical Society, 2012, v. 86, n. 2, p. 177, doi. 10.1017/S0004972711003467
- By:
- Publication type:
- Article
BINDING NUMBER AND MINIMUM DEGREE FOR FRACTIONAL (k,m)-DELETED GRAPHS.
- Published in:
- Bulletin of the Australian Mathematical Society, 2012, v. 85, n. 1, p. 60, doi. 10.1017/S0004972711002784
- By:
- Publication type:
- Article
NEIGHBOURHOOD AND THE EXISTENCE OF FRACTIONAL k-FACTORS OF GRAPHS.
- Published in:
- Bulletin of the Australian Mathematical Society, 2010, v. 81, n. 3, p. 473, doi. 10.1017/S0004972709000963
- By:
- Publication type:
- Article
NEIGHBOURHOODS OF INDEPENDENT SETS FOR (a,b,k)-CRITICAL GRAPHS.
- Published in:
- Bulletin of the Australian Mathematical Society, 2008, v. 77, n. 2, p. 277, doi. 10.1017/S0004972708000270
- By:
- Publication type:
- Article
Notes on the binding numbers for (a, b, k)-critical graphs.
- Published in:
- Bulletin of the Australian Mathematical Society, 2007, v. 76, n. 2, p. 307, doi. 10.1017/S000497270003968X
- By:
- Publication type:
- Article
Some sufficient conditions for graphs to have (g, f)-factors.
- Published in:
- Bulletin of the Australian Mathematical Society, 2007, v. 75, n. 3, p. 447, doi. 10.1017/S0004972700039368
- By:
- Publication type:
- Article
An existence theorem on Hamiltonian (g, f)-factors in networks.
- Published in:
- Journal of Nonlinear Sciences & Applications (JNSA), 2018, v. 11, n. 1, p. 1, doi. 10.22436/jnsa.011.01.01
- By:
- Publication type:
- Article
Minimum Degree Conditions for Graphs to be (g, f, n)-Critical Graphs.
- Published in:
- IAENG International Journal of Applied Mathematics, 2008, v. 38, n. 3, p. 148
- By:
- Publication type:
- Article
Spectral radius and k-factor-critical graphs: Spectral radius and k-factor-critical graphs: S. Zhou et al.
- Published in:
- Journal of Supercomputing, 2025, v. 81, n. 3, p. 1, doi. 10.1007/s11227-024-06902-3
- By:
- Publication type:
- Article
Spectral radius and component factors in graphs.
- Published in:
- Journal of Supercomputing, 2025, v. 81, n. 1, p. 1, doi. 10.1007/s11227-024-06522-x
- By:
- Publication type:
- Article
Spanning k-trees and distance spectral radius in graphs.
- Published in:
- Journal of Supercomputing, 2024, v. 80, n. 16, p. 23357, doi. 10.1007/s11227-024-06355-8
- By:
- Publication type:
- Article