Claw-free graphs are edge reconstructible. - Mark N. Ellingham; László Pyber; Xingxing Yu (J. Graph Theory, 1988)

On neighbourhood line graphs. - Xingxing Yu (Discret. Math., 1990)

Trees and unicyclic graphs with hamiltonian path graphs. - Xingxing Yu (J. Graph Theory, 1990)

On the cycle-isomorphism of graphs. - Xingxing Yu (J. Graph Theory, 1991)

Maximum matchings in 3-connected graphs contain contractible edges. - Robert E. L. Aldred; Robert L. Hemminger; Xingxing Yu (Australas. J Comb., 1992)

On a problem of Hendry. - M. R. Hart; Xingxing Yu (Discret. Math., 1992)

On 3-connected graphs with contractible edge covers of size k. - Robert L. Hemminger; Xingxing Yu (Discret. Math., 1992)

On several symmetry conditions for graphs. - Xingxing Yu (Discret. Math., 1992)

Ends in spanning trees. - Xingxing Yu (Discret. Math., 1992)

Cyclomatic numbers of connected induced subgraphs. - Xingxing Yu (Discret. Math., 1992)

Non-separating cycles and discrete Jordan curves. - Xingxing Yu (J. Comb. Theory B, 1992)

Covering contractible edges in 3-connected graphs. II. Characterizing those with covers of size three. - Robert L. Hemminger; Xingxing Yu (J. Graph Theory, 1993)

Independence ratios of graph powers. - Pavol Hell; Xingxing Yu; Huishan Zhou (Discret. Math., 1994)

Small Circuit Double Covers of Cubic Multigraphs. - Hong-Jian Lai; Xingxing Yu; Cun-Quan Zhang (J. Comb. Theory B, 1994)

4-Connected Projective-Planar Graphs Are Hamiltonian. - Robin Thomas 001; Xingxing Yu (J. Comb. Theory B, 1994)

On hamiltonian-connected graphs. - Ronald J. Gould; Xingxing Yu (J. Graph Theory, 1994)

3-connected graphs with non-cut contractible edge covers of size k. - Xingxing Yu (J. Graph Theory, 1994)

2-walks in 3-connected planar graphs. - Zhicheng Gao; R. Bruce Richter; Xingxing Yu (Australas. J Comb., 1995)

Non-Contractible Edges in A 3-Connected Graph. - Yoshimi Egawa; Katsuhiro Ota; Akira Saito; Xingxing Yu (Comb., 1995)

Spanning paths in infinite planar graphs. - Nathaniel Dean; Robin Thomas 001; Xingxing Yu (J. Graph Theory, 1996)

Convex Programming and Circumference of 3-Connected Graphs of Low Genus. - Zhicheng Gao; Xingxing Yu (J. Comb. Theory B, 1997)

Five-Connected Toroidal Graphs Are Hamiltonian. - Robin Thomas 001; Xingxing Yu (J. Comb. Theory B, 1997)

Tutte cycles in circuit graphs. - Zhicheng Gao; Xingxing Yu (Discret. Math., 1998)

Subdivisions in Planar Graphs. - Xingxing Yu (J. Comb. Theory B, 1998)

A note on fragile graphs. - Guantao Chen; Xingxing Yu (Discret. Math., 2002)

Long Cycles in 3-Connected Graphs. - Guantao Chen; Xingxing Yu (J. Comb. Theory B, 2002)

Hamilton cycles in plane triangulations. - Bill Jackson; Xingxing Yu (J. Graph Theory, 2002)

Long cycles in 3-connected graphs in orientable surfaces. - Laura Sheppardson; Xingxing Yu (J. Graph Theory, 2002)

Ulysses: A Robust, Low-Diameter, Low-Latency Peer-ti-Peer Network. - Abhishek Kumar 003; Shashidhar Merugu; Jun (Jim) Xu; Xingxing Yu (ICNP, 2003)

Chain decompositions and independent trees in 4-connected graphs. - Sean Curran; Orlando Lee; Xingxing Yu (SODA, 2003)

Graph Connectivity After Path Removal. - Guantao Chen; Ronald J. Gould; Xingxing Yu (Comb., 2003)

Nonseparating Cycles in 4-Connected Graphs. - Sean Curran; Xingxing Yu (SIAM J. Discret. Math., 2003)

Bi-truncation for simplified MIMO signal detection. - Wen Jiang 005; Xingxing Yu; Geoffrey Ye Li (GLOBECOM, 2004)

Cycles in 4-connected planar graphs. - Guantao Chen; Genghua Fan; Xingxing Yu (Eur. J. Comb., 2004)

Ulysses: a robust, low-diameter, low-latency peer-to-peer network. - Abhishek Kumar 003; Shashidhar Merugu; Jun (Jim) Xu; Ellen W. Zegura; Xingxing Yu (Eur. Trans. Telecommun., 2004)

Positively curved cubic plane graphs are finite. - Liang Sun; Xingxing Yu (J. Graph Theory, 2004)

Infinite paths in planar graphs I: Graphs with radial nets. - Xingxing Yu (J. Graph Theory, 2004)

On the fundamental tradeoffs between routing table size and network diameter in peer-to-peer networks. - Jun (Jim) Xu; Abhishek Kumar 003; Xingxing Yu (IEEE J. Sel. Areas Commun., 2004)

Circumference of Graphs with Bounded Degree. - Guantao Chen; Jun Xu; Xingxing Yu (SIAM J. Comput., 2004)

Approximating the Longest Cycle Problem on Graphs with Bounded Degree. - Guantao Chen; Zhicheng Gao; Xingxing Yu; Wenan Zang (COCOON, 2005)

Covering planar graphs with forests. - József Balogh; Martin Kochol; András Pluhár; Xingxing Yu (J. Comb. Theory B, 2005)

Hamilton paths in toroidal graphs. - Robin Thomas 001; Xingxing Yu; Wenan Zang (J. Comb. Theory B, 2005)

Infinite paths in planar graphs II, structures and ladder nets. - Xingxing Yu (J. Graph Theory, 2005)

Nonseparating Planar Chains in 4-Connected Graphs. - Sean Curran; Orlando Lee; Xingxing Yu (SIAM J. Discret. Math., 2005)

Chain Decompositions of 4-Connected Graphs. - Sean Curran; Orlando Lee; Xingxing Yu (SIAM J. Discret. Math., 2005)

Erratum to 2-walks in 3-connected planar graphs. - Zhicheng Gao; R. Bruce Richter; Xingxing Yu (Australas. J Comb., 2006)

Contractible Cliques in k-Connected Graphs. - Xiaolong Huang; Zemin Jin; Xingxing Yu; Xiaoyan Zhang (Graphs Comb., 2006)

The circumference of a graph with no K3, t-minor. - Guantao Chen; Laura Sheppardson; Xingxing Yu; Wenan Zang (J. Comb. Theory B, 2006)

Reducing Hajós' 4-coloring conjecture to 4-connected graphs. - Xingxing Yu; Florian Zickfeld (J. Comb. Theory B, 2006)

Infinite paths in planar graphs III, 1-way infinite paths. - Xingxing Yu (J. Graph Theory, 2006)

Infinite paths in planar graphs IV, dividing cycles. - Xingxing Yu (J. Graph Theory, 2006)

Approximating Longest Cycles in Graphs with Bounded Degrees. - Guantao Chen; Zhicheng Gao; Xingxing Yu; Wenan Zang (SIAM J. Comput., 2006)

Finding Four Independent Trees . - Sean Curran; Orlando Lee; Xingxing Yu (SIAM J. Comput., 2006)

On the reconstruction of planar graphs. - Mark Bilinski; Young Soo Kwon; Xingxing Yu (J. Comb. Theory B, 2007)

Contractible subgraphs in k-connected graphs. - Zemin Jin; Xingxing Yu; Xiaoyan Zhang (J. Graph Theory, 2007)

Truncation for Low-Complexity MIMO Signal Detection. - Wen Jiang 005; Geoffrey Ye Li; Xingxing Yu (IEEE Trans. Inf. Theory, 2007)

Triangle-free subcubic graphs with minimum bipartite density. - Baogang Xu; Xingxing Yu (J. Comb. Theory B, 2008)

Infinite paths in planar graphs V, 3-indivisible graphs. - Xingxing Yu (J. Graph Theory, 2008)

Hamilton Cycles in Planar Locally Finite Graphs. - Henning Bruhn; Xingxing Yu (SIAM J. Discret. Math., 2008)

On a bipartition problem of Bollobás and Scott. - Baogang Xu; Xingxing Yu (Comb., 2009)

Preface. - Guantao Chen; Xingxing Yu; Wenan Zang (Discret. Math., 2009)

Hamilton circles in infinite planar graphs. - Qing Cui; Jian Wang 092; Xingxing Yu (J. Comb. Theory B, 2009)

Judicious k-partitions of graphs. - Baogang Xu; Xingxing Yu (J. Comb. Theory B, 2009)

Bounds for pairs in partitions of graphs. - Jie Ma 002; Xingxing Yu (Discret. Math., 2010)

A note on balanced bipartitions. - Baogang Xu; Juan Yan; Xingxing Yu (Discret. Math., 2010)

Independent paths and K5-subdivisions. - Jie Ma 002; Xingxing Yu (J. Comb. Theory B, 2010)

On several partitioning problems of Bollobás and Scott. - Jie Ma 002; Pei-Lan Yen; Xingxing Yu (J. Comb. Theory B, 2010)

Balanced judicious bipartitions of graphs. - Baogang Xu; Juan Yan; Xingxing Yu (J. Graph Theory, 2010)

Better Bounds for k-Partitions of Graphs. - Baogang Xu; Xingxing Yu (Comb. Probab. Comput., 2011)

Approximating the chromatic index of multigraphs. - Guantao Chen; Xingxing Yu; Wenan Zang (J. Comb. Optim., 2011)

Circumference of 3-connected claw-free graphs and large Eulerian subgraphs of 3-edge-connected graphs. - Mark Bilinski; Bill Jackson; Jie Ma 002; Xingxing Yu (J. Comb. Theory B, 2011)

Upper bounds on minimum balanced bipartitions. - Genghua Fan; Baogang Xu; Xingxing Yu; Chuixiang Zhou (Discret. Math., 2012)

Maximum Directed Cuts in Graphs with Degree Constraints. - Baogang Xu; Xingxing Yu (Graphs Comb., 2012)

Bonds with parity constraints. - Xujin Chen; Guoli Ding; Xingxing Yu; Wenan Zang (J. Comb. Theory B, 2012)

The circumference of a graph with no K3, t-minor, II. - Guantao Chen; Xingxing Yu; Wenan Zang (J. Comb. Theory B, 2012)

Partitioning 3-uniform hypergraphs. - Jie Ma 002; Xingxing Yu (J. Comb. Theory B, 2012)

Energy-efficient resource allocation for cognitive radio networks. - Lu Lu 002; Dawei He; Xingxing Yu; Geoffrey Ye Li (GLOBECOM, 2013)

Approximate min-max relations on plane graphs. - Jie Ma 002; Xingxing Yu; Wenan Zang (J. Comb. Optim., 2013)

K5-Subdivisions in graphs containing K-4. - Jie Ma 002; Xingxing Yu (J. Comb. Theory B, 2013)

On judicious bisections of graphs. - Baogang Xu; Xingxing Yu (J. Comb. Theory B, 2014)

Forbidden Subgraphs and 3-Colorings. - Genghua Fan; Baogang Xu; Tianjun Ye; Xingxing Yu (SIAM J. Discret. Math., 2014)

On Tight Components and Anti-Tight Components. - Changhong Lu; Kan Wang; Xingxing Yu (Graphs Comb., 2015)

Subdivisions of K5 in graphs containing K2, 3. - Ken-ichi Kawarabayashi; Jie Ma 002; Xingxing Yu (J. Comb. Theory B, 2015)

Nonseparating Cycles Avoiding Specific Vertices. - Yanmei Hong; Liying Kang; Xingxing Yu (J. Graph Theory, 2015)

Graph-Based Robust Resource Allocation for Cognitive Radio Networks. - Lu Lu 002; Dawei He; Geoffrey Ye Li; Xingxing Yu (IEEE Trans. Signal Process., 2015)

System Prediction of Drug-Drug Interactions Through the Integration of Drug Phenotypic, Therapeutic, Structural, and Genomic Similarities. - Binglei Wang; Xingxing Yu; Ran Wei; Chenxing Yuan; Xiaoyu Li; Chun-Hou Zheng 001 (ICIC (1), 2016)

Graph-based path selection and power allocation for relay-aided transmission. - Lu Lu 002; Dawei He; Qiqin Xie; Geoffrey Ye Li; Xingxing Yu (WCNC, 2016)

On judicious bipartitions of graphs. - Jie Ma 002; Xingxing Yu (Comb., 2016)

On a Coloring Conjecture of Hajós. - Yuqin Sun; Xingxing Yu (Graphs Comb., 2016)

Graphs Containing Topological H. - Jie Ma 002; Qiqin Xie; Xingxing Yu (J. Graph Theory, 2016)

Graph-Based Radio Resource Management for Vehicular Networks. - Le Liang; Shijie Xie; Geoffrey Ye Li; Zhi Ding 001; Xingxing Yu (ICC, 2018)

Bisections of Graphs Without Short Cycles. - Genghua Fan; Jianfeng Hou; Xingxing Yu (Comb. Probab. Comput., 2018)

Circumference of 3-connected cubic graphs. - Qinghai Liu; Xingxing Yu; Zhao Zhang 002 (J. Comb. Theory B, 2018)

Disjoint perfect matchings in 3-uniform hypergraphs. - Hongliang Lu; Xingxing Yu; Li Zhang 037 (J. Graph Theory, 2018)

Almost Perfect Matchings in k-Partite k-Graphs. - Hongliang Lu; Yan Wang; Xingxing Yu (SIAM J. Discret. Math., 2018)

On Rainbow Matchings for Hypergraphs. - Hongliang Lu; Xingxing Yu (SIAM J. Discret. Math., 2018)

Graph-Based Resource Sharing in Vehicular Communication. - Le Liang; Shijie Xie; Geoffrey Ye Li; Zhi Ding 001; Xingxing Yu (IEEE Trans. Wirel. Commun., 2018)

Graph-Based Path Selection and Power Allocation for DF Relay-Aided Transmission. - Lu Lu 002; Dawei He; Qiqin Xie; Geoffrey Ye Li; Xingxing Yu (IEEE Wirel. Commun. Lett., 2018)

On Approximations for Constructing Required Subgraphs Using Stock Pieces of Fixed Length. - Junran Lichen; Jianping Li 007; Ko-Wei Lih; Xingxing Yu (AAIM, 2019)

A Tensor Network for Tropical Cyclone Wind Speed Estimation. - Xingxing Yu; Zhao Chen; Guangchen Chen; He Zhang; Junfeng Zhou (IGARSS, 2019)

A Semisupervised Deep Learning Framework for Tropical Cyclone Intensity Estimation. - Guangchen Chen; Zhao Chen; Feng Zhou; Xingxing Yu; He Zhang; Lingyun Zhu (MultiTemp, 2019)

KL Divergence-Based Pheromone Fusion for Heterogeneous Multi-Colony Ant Optimization. - Mingxia Liu 002; Xiaoming You; Xingxing Yu; Sheng Liu 007 (IEEE Access, 2019)

On problems about judicious bipartitions of graphs. - Yuliang Ji; Jie Ma 002; Juan Yan; Xingxing Yu (J. Comb. Theory B, 2019)

Minimum codegree condition for perfect matchings in k-partite k-graphs. - Hongliang Lu; Yan Wang; Xingxing Yu (J. Graph Theory, 2019)

On Approximations for Constructing 1-Line Minimum Rectilinear Steiner Trees in the Euclidean Plane ℝ2. - Junran Lichen; Jianping Li 007; Wencheng Wang 003; Jean Yeh; Yeong-Nan Yeh; Xingxing Yu; Yujie Zheng (AAIM, 2020)

A Novel Deep Learning Framework for Tropical Cyclone Intensity Estimation Using FY-4 Satellite Imagery. - Xingxing Yu; Zhao Chen; He Zhang; Yuxin Zheng (ICIAI, 2020)

A Regularized Tensor Network for Cyclone Wind Speed Estimation. - Zhao Chen; Xingxing Yu; Feng Zhou; Bin Yang 012 (IGARSS, 2020)

Monochromatic Subgraphs in Iterated Triangulations. - Jie Ma 002; Tianyun Tang; Xingxing Yu (Electron. J. Comb., 2020)

7-Connected graphs are 4-ordered. - Rose McCarty; Yan Wang; Xingxing Yu (J. Comb. Theory B, 2020)

The Kelmans-Seymour conjecture I: Special separations. - Dawei He; Yan Wang; Xingxing Yu (J. Comb. Theory B, 2020)

The Kelmans-Seymour conjecture II: 2-Vertices in K4-. - Dawei He; Yan Wang; Xingxing Yu (J. Comb. Theory B, 2020)

The Kelmans-Seymour conjecture III: 3-vertices in K4-. - Dawei He; Yan Wang; Xingxing Yu (J. Comb. Theory B, 2020)

The Kelmans-Seymour conjecture IV: A proof. - Dawei He; Yan Wang; Xingxing Yu (J. Comb. Theory B, 2020)

Rainbow matchings for 3-uniform hypergraphs. - Hongliang Lu; Xingxing Yu; Xiaofan Yuan (J. Comb. Theory A, 2021)

Partitioning digraphs with outdegree at least 4. - Guanwu Liu; Xingxing Yu (J. Graph Theory, 2021)

Wheels in planar graphs and Hajós graphs. - Qiqin Xie; Shijie Xie; Xingxing Yu; Xiaofan Yuan (J. Graph Theory, 2021)

Number of Hamiltonian Cycles in Planar Triangulations. - Xiaonan Liu; Xingxing Yu (SIAM J. Discret. Math., 2021)

Nearly Perfect Matchings in Uniform Hypergraphs. - Hongliang Lu; Xingxing Yu; Xiaofan Yuan (SIAM J. Discret. Math., 2021)

A Novel Tensor Network for Tropical Cyclone Intensity Estimation. - Zhao Chen; Xingxing Yu (IEEE Trans. Geosci. Remote. Sens., 2021)

A Note on Exact Minimum Degree Threshold for Fractional Perfect Matchings. - Hongliang Lu; Xingxing Yu (Graphs Comb., 2022)

1-line minimum rectilinear steiner trees and related problems. - Jianping Li 007; Junran Lichen; Wencheng Wang 003; Jean Yeh; Yeong-Nan Yeh; Xingxing Yu; Yujie Zheng (J. Comb. Optim., 2022)

Approximation algorithms for constructing required subgraphs using stock pieces of fixed length. - Junran Lichen; Jianping Li 007; Ko-Wei Lih; Xingxing Yu (J. Comb. Optim., 2022)

Counting Hamiltonian cycles in planar triangulations. - Xiaonan Liu; Zhiyu Wang; Xingxing Yu (J. Comb. Theory B, 2022)

4-Separations in Hajós graphs. - Qiqin Xie; Shijie Xie; Xingxing Yu; Xiaofan Yuan (J. Graph Theory, 2022)

Rainbow Perfect Matchings for 4-Uniform Hypergraphs. - Hongliang Lu; Yan Wang; Xingxing Yu (SIAM J. Discret. Math., 2022)

Polynomial χ-binding functions for t-broom-free graphs. - Xiaonan Liu; Joshua Schroeder; Zhiyu Wang; Xingxing Yu (J. Comb. Theory B, 2023)

Tutte paths and long cycles in circuit graphs. - Michael C. Wigal; Xingxing Yu (J. Comb. Theory B, 2023)

Approximating TSP walks in subcubic graphs. - Michael C. Wigal; Youngho Yoo; Xingxing Yu (J. Comb. Theory B, 2023)

Time-Domain Numerical Simulation and Experimental Study on Pulsed Eddy Current Inspection of Tubing and Casing. - Xingxing Yu; Ying Zhu; Yan Cao; Juan Xiong (Sensors, 2023)

A better bound on the size of rainbow matchings. - Hongliang Lu; Yan Wang; Xingxing Yu (J. Comb. Theory A, 2023)

Co-degree threshold for rainbow perfect matchings in uniform hypergraphs. - Hongliang Lu; Yan Wang; Xingxing Yu (J. Comb. Theory B, 2023)

A class of trees determined by their chromatic symmetric functions. - Yuzhenni Wang; Xingxing Yu; Xiao-Dong Zhang 001 (Discret. Math., 2024)

Linkages and removable paths avoiding vertices. - Xiying Du; Yanjia Li; Shijie Xie; Xingxing Yu (J. Comb. Theory B, 2024)

Planar Turán number of the 7-cycle. - Ruilin Shi; Zach Walsh; Xingxing Yu (Eur. J. Comb., 2025)

Dense circuit graphs and the planar Turán number of a cycle. - Ruilin Shi; Zach Walsh; Xingxing Yu (J. Graph Theory, 2025)

On Tutte Cycles Containing Three Prescribed Edges. - Michael C. Wigal; Xingxing Yu (Graphs Comb., 2025)