Xingxing Yu

activity

20152026

most citedA better bound on the size of rainbow matchings

9 citations · 39 across the 35 of their papers we have counts for

collaborators

Showing 2018Show all

3 papers · 1 filter

math.CO2018★ 6 cited

7-Connected Graphs are 4-Ordered

Rose McCarty, Yan Wang, Xingxing Yu

A graph $G$ is $k$ -ordered if for any distinct vertices $v_{1}, v_{2}, \dots, v_{k} \in V (G)$ , it has a cycle through $v_{1}, v_{2}, \dots, v_{k}$ in order. Let $f (k)$ denote the minimum int…

math.CO2018

A bound on judicious bipartitions of directed graphs

Jianfeng Hou, Huawen Ma, Xingxing Yu +1

Judicious partitioning problems on graphs ask for partitions that bound several quantities simultaneously, which have received a lot of attentions lately. Scott asked the following…

cs.IT2018★ 2 cited

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)…