Renyu Xu
Research Subjects
Research Interests
Renyu Xu has a total of 7 co-authors. Here are the top co-authors by number of shared publications:
Benjamim K. Ng
1 shared publicationChan-Tong Lam
1 shared publicationJian-Liang Wu
1 shared publicationQingle Wu
1 shared publicationXingzhong Xiong
1 shared publication- Yiduo Zhang1 shared publication
Latest Publications
- Open Access
- 7 October 2026
- Published by Elsevier in SSRN Electronic Journal
The Linear Arboricity of W_5 -minor free graphs
The linear arboricity la(G) of a graph G is the minimum number of linear forests which partition the edges of G. In 1980, Akiyama et al. conjectured that for any graph G, \la{\Delta(G)}\leq la(G) \leq \la{\Delta(G)+1}. In the paper, we establish the essential structural properties of W_5-minor free graphs G and then prove here that if G is a W_5-minor free graph and \Delta (G)\geq 5, then la(G)= \la{\Delta(G)}.
- 7 October 2026
- Published by Elsevier in SSRN Electronic Journal
Open AccessThe Linear Arboricity of W_5 -minor free graphs
The linear arboricity la(G) of a graph G is the minimum number of linear forests which partition the edges of G. In 1980, Akiyama et al. conjectured that for any graph G, \la{\Delta(G)}\leq la(G) \leq \la{\Delta(G)+1}. In the paper, we establish the essential structural properties of W_5-minor free graphs G and then prove here that if G is a W_5-minor free graph and \Delta (G)\geq 5, then la(G)= \la{\Delta(G)}.
- 10 April 2026
- Published by Elsevier in Physical Communication
- Vol. 76
Multiplication-free intelligent communication receiver enabled by bimodal power-aware quantization
- 10 April 2026
- Published by Elsevier in Physical Communication
- Vol. 76
Multiplication-free intelligent communication receiver enabled by bimodal power-aware quantization
- 1 December 2019
- Published by Elsevier in Applied Mathematics and Computation
- Vol. 363
The list linear arboricity of planar graphs with 7-cycles containing at most two chords
- 1 December 2019
- Published by Elsevier in Applied Mathematics and Computation
- Vol. 363
The list linear arboricity of planar graphs with 7-cycles containing at most two chords
- 1 June 2017
- Published by Elsevier in Discrete Applied Mathematics
- Vol. 224, 120-122
A sufficient condition for a planar graph to be -choosable- 1 June 2017
- Published by Elsevier in Discrete Applied Mathematics
- Vol. 224, 120-122
A sufficient condition for a planar graph to be -choosable