UB Paderborn / Katalog / Suche / in CDI

Some Results on Path-Factor Critical Avoidable Graphs

Discussiones Mathematicae. Graph Theory, 2023-02, Vol.43 (1), p.233-244

Zhou, Sizhong

2023

Link zum Volltext

Verfügbarkeit prüfen

On path-factor critical deleted (or covered) graphs

Aequationes mathematicae, 2022-08, Vol.96 (4), p.795-802

2022

Link zum Volltext

Verfügbarkeit prüfen

Some sufficient conditions for path-factor uniform graphs

Aequationes mathematicae, 2023-06, Vol.97 (3), p.489-500

2023

Link zum Volltext

Verfügbarkeit prüfen

Distance signless Laplacian spectral radius for the existence of path-factors in graphs

Aequationes mathematicae, 2024, Vol.98 (3), p.727-737

2024

Link zum Volltext

Verfügbarkeit prüfen

A sufficient condition for graphs to be fractional ( k , m ) -deleted graphs

Applied mathematics letters, 2011-09, Vol.24 (9), p.1533-1538

Zhou, Sizhong

2011

Link zum Volltext

Verfügbarkeit prüfen

Isolated toughness and path-factor uniform graphs (II)

Indian journal of pure and applied mathematics, 2023-09, Vol.54 (3), p.689-696

2023

Link zum Volltext

Verfügbarkeit prüfen

A neighborhood union condition for fractional (a,b,k)-critical covered graphs

Discrete Applied Mathematics, 2022-12, Vol.323, p.343-348

Zhou, Sizhong

2022

Link zum Volltext

Verfügbarkeit prüfen

Two sufficient conditions for component factors in graphs

Discussiones Mathematicae. Graph Theory, 2023-01, Vol.43 (3), p.761

2023

Link zum Volltext

Verfügbarkeit prüfen

Binding numbers and restricted fractional (g,f)-factors in graphs

Discrete Applied Mathematics, 2021-12, Vol.305, p.350-356

Zhou, Sizhong

2021

Link zum Volltext

Verfügbarkeit prüfen

Nash-Williams conditions for the existence of all fractional [a, b]-factors

Indian journal of pure and applied mathematics, 2021-06, Vol.52 (2), p.542-547

2021

Link zum Volltext

Verfügbarkeit prüfen

Sample sizes and population differences in brain template construction

NeuroImage (Orlando, Fla.), 2020-02, Vol.206, p.116318-116318, Article 116318

2020

Link zum Volltext

Verfügbarkeit prüfen

Some results about ID-path-factor critical graphs

Discrete mathematics letters, 2023-01, Vol.12, p.154-158

2023

Link zum Volltext

Verfügbarkeit prüfen

Binding numbers and [ a , b ] -factors excluding a given k-factor

Comptes rendus. Mathématique, 2011-11, Vol.349 (19), p.1021-1024

Zhou, Sizhong

2011

Link zum Volltext

Verfügbarkeit prüfen

Nowhere-Zero Unoriented 6-Flows on Certain Triangular Graphs

Discussiones Mathematicae. Graph Theory, 2022-08, Vol.42 (3), p.727-746

2022

Link zum Volltext

Verfügbarkeit prüfen

A minimum degree condition of fractional ( k , m ) -deleted graphs

Comptes rendus. Mathématique, 2009-11, Vol.347 (21), p.1223-1226

Zhou, Sizhong

2009

Link zum Volltext

Verfügbarkeit prüfen

The existence of subdigraphs with orthogonal factorizations in digraphs

AIMS mathematics, 2021-01, Vol.6 (2), p.1223-1233

2021

Link zum Volltext

Verfügbarkeit prüfen

Component factors and binding number conditions in graphs

AIMS mathematics, 2021-01, Vol.6 (11), p.12460-12470

2021

Link zum Volltext

Verfügbarkeit prüfen

Two sufficient conditions for odd [1,b]-factors in graphs

Linear algebra and its applications, 2023-03, Vol.661, p.149-162

2023

Link zum Volltext

Verfügbarkeit prüfen

Binding number conditions for P≥2-factor and P≥3-factor uniform graphs

Discrete mathematics, 2020-03, Vol.343 (3), p.111715, Article 111715

2020

Link zum Volltext

Verfügbarkeit prüfen

The Existence Of P≥3-Factor Covered Graphs

Discussiones Mathematicae. Graph Theory, 2017-01, Vol.37 (4), p.1055-1065

2017

Link zum Volltext

Verfügbarkeit prüfen

Remarks on orthogonal factorizations of digraphs

International journal of computer mathematics, 2014-10, Vol.91 (10), p.2109-2117

Zhou, Sizhong

2014

Link zum Volltext

Verfügbarkeit prüfen

Path factors in subgraphs

Discrete Applied Mathematics, 2022-10, Vol.319, p.183-191

2022

Link zum Volltext

Verfügbarkeit prüfen

A note on fractional ID-[a,b]-factor-critical covered graphs

Discrete Applied Mathematics, 2022-10, Vol.319, p.511-516

2022

Link zum Volltext

Verfügbarkeit prüfen

DEGREE CONDITIONS AND FRACTIONAL k-FACTORS OF GRAPHS

대한수학회보, 2011, 48(2), , pp.353-363

Zhou, Sizhong

2011

Link zum Volltext

Verfügbarkeit prüfen

A Neighborhood Condition for Fractional ID-[A, B]-Factor-Critical Graphs

Discussiones Mathematicae. Graph Theory, 2016-05, Vol.36 (2), p.409-418

2016

Link zum Volltext

Verfügbarkeit prüfen

Menü

Weitere Dienste

Einstellungen

Some Results on Path-Factor Critical Avoidable Graphs

On path-factor critical deleted (or covered) graphs

Some sufficient conditions for path-factor uniform graphs

Distance signless Laplacian spectral radius for the existence of path-factors in graphs

A sufficient condition for graphs to be fractional ( k , m ) -deleted graphs

Isolated toughness and path-factor uniform graphs (II)

A neighborhood union condition for fractional (a,b,k)-critical covered graphs

Two sufficient conditions for component factors in graphs

Binding numbers and restricted fractional (g,f)-factors in graphs

Nash-Williams conditions for the existence of all fractional [a, b]-factors

Sample sizes and population differences in brain template construction

Some results about ID-path-factor critical graphs

Binding numbers and [ a , b ] -factors excluding a given k-factor

Nowhere-Zero Unoriented 6-Flows on Certain Triangular Graphs

A minimum degree condition of fractional ( k , m ) -deleted graphs

The existence of subdigraphs with orthogonal factorizations in digraphs

Component factors and binding number conditions in graphs

Two sufficient conditions for odd [1,b]-factors in graphs

Binding number conditions for P≥2-factor and P≥3-factor uniform graphs

The Existence Of P≥3-Factor Covered Graphs

Remarks on orthogonal factorizations of digraphs

Path factors in subgraphs

A note on fractional ID-[a,b]-factor-critical covered graphs

DEGREE CONDITIONS AND FRACTIONAL k-FACTORS OF GRAPHS

A Neighborhood Condition for Fractional ID-[A, B]-Factor-Critical Graphs

Suchergebnisse filtern