Zhiren Sun

According to our database, Zhiren Sun authored at least 21 papers between 1998 and 2024.

Collaborative distances:

• Dijkstra number of five.
• Erdős number of three.

2024

An approximation algorithm for high-dimensional table compression on balanced K-partite graph.

Guangfeng Li, Jian Sun, Zhiren Sun, Donglei Du, Xiaoyan Zhang

Comput. Electr. Eng., January, 2024

The A-spectral radius for path-factors in graphs.

Sizhong Zhou, Yuli Zhang, Zhiren Sun

Discret. Math., 2024

D-index and Q-index for spanning trees with leaf degree at most k in graphs.

Sizhong Zhou, Zhiren Sun, Hongxia Liu

Discret. Math., 2024

2023

Two sufficient conditions for component factors in graphs.

Sizhong Zhou, Qiuxiang Bian, Zhiren Sun

Discuss. Math. Graph Theory, 2023

2021

Isolated toughness and path-factor uniform graphs.

Sizhong Zhou, Zhiren Sun, Hongxia Liu

RAIRO Oper. Res., 2021

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

Sizhong Zhou, Zhiren Sun

Contributions Discret. Math., 2021

2020

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

Sizhong Zhou, Zhiren Sun, Q. Pan

Probl. Inf. Transm., 2020

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

Sizhong Zhou, Zhiren Sun

Discret. Math., 2020

2019

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

Sizhong Zhou, Yang Xu, Zhiren Sun

Inf. Process. Lett., 2019

2018

A generalization of orthogonal factorizations in digraphs.

Zhiren Sun, Sizhong Zhou

Inf. Process. Lett., 2018

2017

A result on r-orthogonal factorizations in digraphs.

Sizhong Zhou, Zhiren Sun, Zurun Xu

Eur. J. Comb., 2017

2016

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

Zhiren Sun, Fan Yang, Sizhong Zhou

Discuss. Math. Graph Theory, 2016

2015

A theorem on fractional ID-(g, f)-factor-critical graphs.

Sizhong Zhou, Zhiren Sun, Yang Xu

Contributions Discret. Math., 2015

2014

Toughness and Degree condition for fractional ID-k-factor-Critical graphs.

Yuan Yuan, Zhiren Sun

Discret. Math. Algorithms Appl., 2014

2013

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

Sizhong Zhou, Zhiren Sun, Hui Ye

Inf. Process. Lett., 2013

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

Daqiang Zhang, Qin Zou, Zhiren Sun

CoRR, 2013

2008

On 3-choosability of planar graphs without certain cycles.

Haihui Zhang, Zhiren Sun

Inf. Process. Lett., 2008

2006

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

Haihui Zhang, Baogang Xu, Zhiren Sun

Ars Comb., 2006

2001

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

Zhiren Sun, Feng Tian, Bing Wei

Graphs Comb., 2001

Degree Sums, Connectivity and Dominating Cycles in Graphs.

Zhiren Sun, Feng Tian, Bing Wei

Graphs Comb., 2001

1998

Hamiltonicity in 2-connected graphs with claws.

Hao Li, Mei Lu, Zhiren Sun

Discret. Math., 1998