2 citations · 2 across the 4 of their papers we have counts for
4 papers
Linkages and removable paths avoiding vertices
Xiying Du, Yanjia Li, Shijie Xie +1
We say that a graph is -linked if, for any distinct vertices in , there exist vertex disjoint connected subgraphs of such that $\…
4-Separations in Hajós Graphs
Qiqin Xie, Shijie Xie, Xiaofan Yuan +1
As a natural extension of the Four Color Theorem, Hajós conjectured that graphs containing no -subdivision are 4-colorable. Any possible counterexample to this conjecture with…
Wheels in planar graphs and Hajós graphs
Qiqin Xie, Shijie Xie, Xingxing Yu +1
It was conjectured by Hajós that graphs containing no -subdivision are 4-colorable. Previous results show that any possible minimum counterexample to Hajós' conjecture, called…
Graph-Based Radio Resource Management for Vehicular Networks
Le Liang, Shijie Xie, Geoffrey Ye Li +2
This paper investigates the resource allocation problem in device-to-device (D2D)-based vehicular communications, based on slow fading statistics of channel state information (CSI)…