Zhiren Sun

According to our database1, Zhiren Sun authored at least 19 papers between 1998 and 2024.

Collaborative distances:

Timeline

Legend:

Book 
In proceedings 
Article 
PhD thesis 
Dataset
Other 

Links

On csauthors.net:

Bibliography

2024
An approximation algorithm for high-dimensional table compression on balanced K-partite graph.
Comput. Electr. Eng., January, 2024

2023
Two sufficient conditions for component factors in graphs.
Discuss. Math. Graph Theory, 2023

2021
Isolated toughness and path-factor uniform graphs.
RAIRO Oper. Res., 2021

A neighborhood condition for graphs to have restricted fractional (g, f)-factors.
Contributions Discret. Math., 2021

2020
A Sufficient Condition for the Existence of Restricted Fractional (g, f)-Factors in Graphs.
Probl. Inf. Transm., 2020

Binding number conditions for P≥2-factor and P≥3-factor uniform graphs.
Discret. Math., 2020

2019
Degree conditions for fractional (<i>a</i>, <i>b</i>, <i>k</i>)-critical covered graphs.
Inf. Process. Lett., 2019

2018
A generalization of orthogonal factorizations in digraphs.
Inf. Process. Lett., 2018

2017
A result on r-orthogonal factorizations in digraphs.
Eur. J. Comb., 2017

2016
A neighborhood condition for fractional ID-[<i>a, b</i>]-factor-critical graphs.
Discuss. Math. Graph Theory, 2016

2015
A theorem on fractional ID-(g, f)-factor-critical graphs.
Contributions Discret. Math., 2015

2014
Toughness and Degree condition for fractional ID-k-factor-Critical graphs.
Discret. Math. Algorithms Appl., 2014

2013
A toughness condition for fractional (<i>k</i>, <i>m</i>)-deleted graphs.
Inf. Process. Lett., 2013

SECA: Snapshot-based Event Detection for Checking Asynchronous Context Consistency in Ubiquitous Computing
CoRR, 2013

2008
On 3-choosability of planar graphs without certain cycles.
Inf. Process. Lett., 2008

2006
Every Plane Graph with Girth at least 4 without 8- and 9-circuits is 3-Choosable.
Ars Comb., 2006

2001
Long Cycles Passing Through a Specified Edge in 3-Connected Graphs.
Graphs Comb., 2001

Degree Sums, Connectivity and Dominating Cycles in Graphs.
Graphs Comb., 2001

1998
Hamiltonicity in 2-connected graphs with claws.
Discret. Math., 1998


  Loading...