Renyu Xu

According to our database, Renyu Xu authored at least 7 papers between 2014 and 2019.

Collaborative distances:

• Dijkstra number of four.
• Erdős number of two.

2019

The list linear arboricity of planar graphs with 7-cycles containing at most two chords.

Renyu Xu

Appl. Math. Comput., 2019

2018

Safe sets in graphs: Graph classes and structural parameters.

Raquel Águeda, Nathann Cohen, Shinya Fujita, Sylvain Legay, Yannis Manoussakis, Yasuko Matsui, Leandro Montero, Reza Naserasr, Hirotaka Ono, Yota Otachi, Tadashi Sakuma, Zsolt Tuza, Renyu Xu

J. Comb. Optim., 2018

2017

Some coloring problems of graphs. (Quelques problèmes de coloration du graphe).

Renyu Xu

PhD thesis, 2017

A sufficient condition for a planar graph to be 4-choosable.

Renyu Xu, Jian-Liang Wu

Discret. Appl. Math., 2017

2016

Neighbor sum distinguishing total coloring of graphs embedded in surfaces of nonnegative Euler characteristic.

Renyu Xu, Jian-Liang Wu, Jin Xu

J. Comb. Optim., 2016

Safe Sets in Graphs: Graph Classes and Structural Parameters.

Raquel Águeda, Nathann Cohen, Shinya Fujita, Sylvain Legay, Yannis Manoussakis, Yasuko Matsui, Leandro Montero, Reza Naserasr, Yota Otachi, Tadashi Sakuma, Zsolt Tuza, Renyu Xu

Proceedings of the Combinatorial Optimization and Applications, 2016

2014

Total coloring of planar graphs with 7-cycles containing at most two chords.

Renyu Xu, Jian-Liang Wu

Theor. Comput. Sci., 2014