3 papers
math.CO2020
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…
math.CO2016
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 $…
math.CO2012
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…