Total coloring of planar graphs with 7-cycles containing at most two chords. - Renyu Xu; Jian-Liang Wu 001 (Theor. Comput. Sci., 2014)

Safe Sets in Graphs: Graph Classes and Structural Parameters. - Raquel Águeda; Nathann Cohen; Shinya Fujita 001; Sylvain Legay; Yannis Manoussakis; Yasuko Matsui; Leandro Montero; Reza Naserasr; Yota Otachi; Tadashi Sakuma; Zsolt Tuza; Renyu Xu (COCOA, 2016)

Neighbor sum distinguishing total coloring of graphs embedded in surfaces of nonnegative Euler characteristic. - Renyu Xu; Jian-Liang Wu 001; Jin Xu (J. Comb. Optim., 2016)

A sufficient condition for a planar graph to be 4-choosable. - Renyu Xu; Jian-Liang Wu 001 (Discret. Appl. Math., 2017)

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

Safe sets in graphs: Graph classes and structural parameters. - Raquel Águeda; Nathann Cohen; Shinya Fujita 001; Sylvain Legay; Yannis Manoussakis; Yasuko Matsui; Leandro Montero; Reza Naserasr; Hirotaka Ono 001; Yota Otachi; Tadashi Sakuma; Zsolt Tuza; et al. (J. Comb. Optim., 2018)

The list linear arboricity of planar graphs with 7-cycles containing at most two chords. - Renyu Xu (Appl. Math. Comput., 2019)