3 citations · 4 across the 5 of their papers we have counts for
6 papers
Precoloring 3-extension on outerplanar graphs
Xingchao Deng, Beiyan Zou, Hong Zhai
The precoloring problem of a graph involves assigning colors to some vertices beforehand, and the objective is to determine whether it can be extended to a proper k-coloring of the…
On the distance-edge-monitoring numbers of graphs
Chengxu Yang, Ralf Klasing, Yaping Mao +1
Foucaud et al. [Discrete Appl. Math. 319 (2022), 424-438] recently introduced and initiated the study of a new graph-theoretic concept in the area of network monitoring. For a set…
A note on a conjecture of star chromatic index for outerplanar graphs
Xingchao Deng, Qingye Yao, Yanbing Zhang +1
A star edge coloring of a graph is a proper edge coloring of without bichromatic paths or cycles of length four. The it star chromatic index, of is t…
Rainbow connection of bridgeless outerplanar graphs with small diameters
Xingchao Deng, He Song, Guifu Su +1
In this paper, we investigate rainbow connection number of bridgeless outerplanar graphs with diameter 2 or 3. We proved the following results: If has diameter …
Algorithm on rainbow connection for maximal outerplanar graphs
Xingchao Deng, Hengzhe Li, Guiying Yan
In this paper, we consider rainbow connection number of maximal outerplanar graphs(MOPs) on algorithmic aspect. For the (MOP) , we give sufficient conditions to guarantee that $…
Concentration properties of semi-vertex transitive graphs and random bi-coset graphs
Xingchao Deng, Kainan Xiang
It is well-known that concentrators are sparse graphs of high connectivity, which play a key role in the construction of switching networks; and any semi-vertex transitive graph is…