Xingchao Deng

According to our database, Xingchao Deng authored at least 12 papers between 2012 and 2024.

Collaborative distances:

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

2024

Distance-edge-monitoring numbers of some related pseudo wheel networks.

Chenxu Yang, Xingchao Deng, Zhen Ji, Wen Li

Int. J. Parallel Emergent Distributed Syst., May, 2024

On the distance-edge-monitoring numbers of graphs.

Chenxu Yang, Ralf Klasing, Yaping Mao, Xingchao Deng

Discret. Appl. Math., January, 2024

2023

Toughness and binding number bounds of star-like and path factor.

Xinge Feng, Xingchao Deng

RAIRO Oper. Res., May, 2023

2022

On the distance-edge-monitoring numbers of graphs.

Chengxu Yang, Ralf Klasing, Yaping Mao, Xingchao Deng

CoRR, 2022

2020

A note on a conjecture of star chromatic index for outerplanar graphs.

Xingchao Deng, Qingye Yao, Yanbing Zhang, Xudong Cui

Appl. Math. Comput., 2020

2019

The (<i>d</i>, 1)-total labelling of Sierpin'ski-like graphs.

Xingchao Deng, Zhiwei Shao, Huan Zhang, Weihua Yang

Appl. Math. Comput., 2019

2017

Supereulerian graphs and Chvatal-Erdos type conditions.

Weihua Yang, Wei-Hua He, Hao Li, Xingchao Deng

Ars Comb., 2017

2016

Algorithm on rainbow connection for maximal outerplanar graphs.

Xingchao Deng, Hengzhe Li, Guiying Yan

Theor. Comput. Sci., 2016

2014

Outer-connected domination in 2-connected cubic graphs.

Shipeng Wang, Baoyindureng Wu, Xinhui An, Xiaoping Liu, Xingchao Deng

Discret. Math. Algorithms Appl., 2014

2013

A Note on Semi-coloring of Graphs.

Baoyindureng Wu, Xingchao Deng, Xinhui An, Guiying Yan

Graphs Comb., 2013

The Diameters of Almost All Bi-Cayley Graphs.

Xingchao Deng, Jixiang Meng

Ars Comb., 2013

2012

Polynomial algorithm for sharp upper bound of rainbow connection number of maximal outerplanar graphs.

Xingchao Deng, Kai-Nan Xiang, Baoyindureng Wu

Appl. Math. Lett., 2012