We stand with Ukraine  

Zheng Yan

Affiliations:
  • Yangtze University, Jingzhou, China
  • Ibaraki University, Hitachi, Ibaraki, Japan (former)


According to our database1, Zheng Yan authored at least 12 papers between 2012 and 2020.

Collaborative distances:

Timeline

Legend:

Book 
In proceedings 
Article 
PhD thesis 
Dataset
Other 

Links

On csauthors.net:

Bibliography

2020
Strong Tutte type conditions and factors of graphs.
[BibTeX]
[DOI]
Mikio Kano
,
Zheng Yan
Discuss. Math. Graph Theory, 2020

2019
On conditional fault tolerance of hierarchical cubic networks.
[BibTeX]
[DOI]
Xiang-Jun Li
,
Min Liu
,
Zheng Yan
,
Jun-Ming Xu
Theor. Comput. Sci., 2019

2018
On 3-stable number conditions in n-connected claw-free graphs.
[BibTeX]
[DOI]
Zheng Yan
,
Masao Tsugaki
Discret. Math., 2018

2017
On fault tolerance of (n, k)-star networks.
[BibTeX]
[DOI]
Xiang-Jun Li
,
Yong-Ni Guan
,
Zheng Yan
,
Jun-Ming Xu
Theor. Comput. Sci., 2017

Independence Number and k-Trees of Graphs.
[BibTeX]
[DOI]
Zheng Yan
Graphs Comb., 2017

2016
Embedded connectivity of recursive networks.
[BibTeX]
[DOI]
Xiang-Jun Li
,
Qi-Qi Dong
,
Zheng Yan
,
Jun-Ming Xu
Theor. Comput. Sci., 2016

(1, f)-Factors of Graphs with Odd Property.
[BibTeX]
[DOI]
Yoshimi Egawa
,
Mikio Kano
,
Zheng Yan
Graphs Comb., 2016

Spanning trees with bounded degrees and leaves.
[BibTeX]
[DOI]
Mikio Kano
,
Zheng Yan
Discret. Math., 2016

2015
Spanning Trees Whose Stems are Spiders.
[BibTeX]
[DOI]
Mikio Kano
,
Zheng Yan
Graphs Comb., 2015

2014
Star-cycle factors of graphs.
[BibTeX]
[DOI]
Yoshimi Egawa
,
Mikio Kano
,
Zheng Yan
Discuss. Math. Graph Theory, 2014

Spanning trees whose stems have at most k leaves.
[BibTeX]
Mikio Kano
,
Zheng Yan
Ars Comb., 2014

2012
Spanning Caterpillars Having at Most k Leaves.
[BibTeX]
[DOI]
Mikio Kano
,
Tomoki Yamashita
,
Zheng Yan
Proceedings of the Computational Geometry and Graphs - Thailand-Japan Joint Conference, 2012


  Loading...