Xingxing Yu

发表

Graph-Based Radio Resource Management for Vehicular Networks

Zhi Ding, Geoffrey Ye Li, Le Liang, 2018, 2018 IEEE International Conference on Communications (ICC).

Bounds for pairs in partitions of graphs

Jie Ma, Xingxing Yu, 2010, Discret. Math..

Infinite paths in planar graphs IV, dividing cycles

Xingxing Yu, Xingxing Yu, 2006, J. Graph Theory.

The circumference of a graph with no K3, t-minor, II

Xingxing Yu, Wenan Zang, Guantao Chen, 2012, J. Comb. Theory, Ser. B.

Ends in spanning trees

Xingxing Yu, 1992, Discret. Math..

Graph-based robust resource allocation for cognitive radio networks

Geoffrey Ye Li, Xingxing Yu, Lu Lu, 2015, 2014 IEEE International Conference on Acoustics, Speech and Signal Processing (ICASSP).

On judicious bipartitions of graphs

Jie Ma, Xingxing Yu, 2016, Comb..

Upper bounds on minimum balanced bipartitions

Baogang Xu, Xingxing Yu, Genghua Fan, 2012, Discret. Math..

Cyclomatic numbers of connected induced subgraphs

Xingxing Yu, 1992, Discret. Math..

2-walks in 3-connected Planar Graphs

Xingxing Yu, Zhicheng Gao, R. Bruce Richter, 1995, Australas. J Comb..

Partitioning 3-uniform hypergraphs

Jie Ma, Xingxing Yu, 2012, J. Comb. Theory, Ser. B.

A note on fragile graphs

Xingxing Yu, Guantao Chen, 2002, Discret. Math..

Cyclone Intensity Estimation Using Multispectral Imagery from the FY-4 Satellite

Xingxing Yu, Zhao Chen, Guangchen Chen, 2018, 2018 International Conference on Audio, Language and Image Processing (ICALIP).

Forbidden Subgraphs and 3-Colorings

Baogang Xu, Xingxing Yu, Genghua Fan, 2014, SIAM J. Discret. Math..

Graph-based path selection and power allocation for relay-aided transmission

Geoffrey Ye Li, Xingxing Yu, Lu Lu, 2016, 2016 IEEE Wireless Communications and Networking Conference.

3-connected Graphs with Non-cut Contractible Edge Covers of Size K

Xingxing Yu, Xingxing Yu, 1994, J. Graph Theory.

Circumference of Graphs with Bounded Degree

Jun Xu, Xingxing Yu, Guantao Chen, 2004, SIAM J. Comput..

Covering planar graphs with forests

Xingxing Yu, József Balogh, Martin Kochol, 2005, J. Comb. Theory, Ser. B.

Ulysses: a robust, low-diameter, low-latency peer-to-peer network

Abhishek Kumar, Xingxing Yu, Jun Xu, 2003, 11th IEEE International Conference on Network Protocols, 2003. Proceedings..

The circumference of a graph with no K3, t-minor

Xingxing Yu, Wenan Zang, Guantao Chen, 2006, J. Comb. Theory, Ser. B.

Approximating the chromatic index of multigraphs

Xingxing Yu, Wenan Zang, Guantao Chen, 2011, J. Comb. Optim..

Erratum to 2-walks in 3-connected planar graphs

Xingxing Yu, Zhicheng Gao, R. Bruce Richter, 2006, Australas. J Comb..

K5-Subdivisions in graphs containing K-4

Jie Ma, Xingxing Yu, 2013, J. Comb. Theory, Ser. B.

Long Cycles in 3-Connected Graphs

Xingxing Yu, Guantao Chen, Guantao Chen, 2002, J. Comb. Theory, Ser. B.

Cycles in 4-connected planar graphs

Xingxing Yu, Genghua Fan, Guantao Chen, 2004, Eur. J. Comb..

Covering contractible edges in 3-connected graphs. II. Characterizing those with covers of size three

Robert L. Hemminger, Xingxing Yu, 1993, J. Graph Theory.

Tutte cycles in circuit graphs

Xingxing Yu, Zhicheng Gao, 1998, Discret. Math..

On neighbourhood line graphs

Xingxing Yu, Xingxing Yu, 1991, Discret. Math..

Chain decompositions and independent trees in 4-connected graphs

Xingxing Yu, Orlando Lee, Sean Curran, 2003, SODA '03.

Circumference of 3-connected claw-free graphs and large Eulerian subgraphs of 3-edge-connected graphs

Jie Ma, Bill Jackson, Xingxing Yu, 2011, J. Comb. Theory, Ser. B.

Independent paths and K5-subdivisions

Jie Ma, Xingxing Yu, 2010, J. Comb. Theory, Ser. B.

The Kelmans-Seymour conjecture IV: A proof

Xingxing Yu, Yan Wang, Dawei He, 2016, J. Comb. Theory, Ser. B.

Convex Programming and Circumference of 3-Connected Graphs of Low Genus

Xingxing Yu, Zhicheng Gao, 1997, J. Comb. Theory, Ser. B.

A note on balanced bipartitions

Baogang Xu, Xingxing Yu, Juan Yan, 2010, Discret. Math..

The Kelmans-Seymour conjecture I: Special separations

Xingxing Yu, Dawei He, Yan Wang, 2020, J. Comb. Theory, Ser. B.

Small Circuit Double Covers of Cubic Multigraphs

Hong-Jian Lai, Cun-Quan Zhang, Xingxing Yu, 1994, J. Comb. Theory, Ser. B.

Bonds with parity constraints

Xingxing Yu, Xujin Chen, Wenan Zang, 2012, J. Comb. Theory, Ser. B.

Non-separating cycles and discrete Jordan curves

Xingxing Yu, 1992, J. Comb. Theory, Ser. B.

On a Coloring Conjecture of Hajós

Xingxing Yu, Yuqin Sun, 2016, Graphs Comb..

Infinite paths in planar graphs V, 3‐indivisible graphs

Xingxing Yu, Xingxing Yu, 2008, Journal of Graph Theory.

Hamilton cycles in plane triangulations

Bill Jackson, Xingxing Yu, 2002, J. Graph Theory.

On hamiltonian-connected graphs

Xingxing Yu, Ronald J. Gould, R. Gould, 1994, J. Graph Theory.

Graph-Based Resource Sharing in Vehicular Communication

Zhi Ding, Geoffrey Ye Li, Le Liang, 2018, IEEE Transactions on Wireless Communications.

Better Bounds for k-Partitions of Graphs

Baogang Xu, Xingxing Yu, Baogang Xu, 2011, Combinatorics, Probability and Computing.

Reducing Hajós' 4-coloring conjecture to 4-connected graphs

Xingxing Yu, Florian Zickfeld, 2006, J. Comb. Theory, Ser. B.

Nonseparating Cycles Avoiding Specific Vertices

Xingxing Yu, Liying Kang, Yanmei Hong, 2015, J. Graph Theory.

Chain Decompositions of 4-Connected Graphs

Xingxing Yu, Orlando Lee, Sean Curran, 2005, SIAM J. Discret. Math..

Disjoint perfect matchings in 3-uniform hypergraphs

Xingxing Yu, Hongliang Lu, Li Zhang, 2018, J. Graph Theory.

Almost Perfect Matchings in k-Partite k-Graphs

Yan Wang, Xingxing Yu, Hongliang Lu, 2018, SIAM J. Discret. Math..

Independence ratios of graph powers

Xingxing Yu, Pavol Hell, Huishan Zhou, 1994, Discret. Math..

Maximum matchings in 3-connected graphs contain contractible edges

Robert L. Hemminger, Xingxing Yu, Robert E. L. Aldred, 1992, Australas. J Comb..

On 3-connected graphs with contractible edge covers of size k

Robert L. Hemminger, Xingxing Yu, 1992, Discret. Math..

On Tight Components and Anti-Tight Components

Xingxing Yu, Changhong Lu, Kan Wang, 2015, Graphs Comb..

Judicious k-partitions of graphs

Baogang Xu, Xingxing Yu, Baogang Xu, 2009, J. Comb. Theory B.

On a bipartition problem of Bollobás and Scott

Baogang Xu, Xingxing Yu, 2009, Comb..

Adaptive recursive least squares algorithm for joint FIR filtering and pre-delay tracking and its application in the chemical industry process modeling

Xingxing Yu, Pingfan Yan, Dali Zhang, 1996, Proceedings of the IEEE International Conference on Industrial Technology (ICIT'96).

Infinite paths in planar graphs III, 1‐way infinite paths

Xingxing Yu, Xingxing Yu, 2006, J. Graph Theory.

Hamilton paths in toroidal graphs

Robin Thomas, Xingxing Yu, Wenan Zang, 2005, J. Comb. Theory, Ser. B.

7-Connected graphs are 4-ordered

Xingxing Yu, Yan Wang, Rose McCarty, 2018, J. Comb. Theory, Ser. B.

On judicious bisections of graphs

Baogang Xu, Xingxing Yu, Baogang Xu, 2014, J. Comb. Theory B.

The Kelmans-Seymour conjecture III: 3-vertices in K4-

Xingxing Yu, Yan Wang, Dawei He, 2020, J. Comb. Theory, Ser. B.

Infinite paths in planar graphs II, structures and ladder nets

Xingxing Yu, Xingxing Yu, 2005, J. Graph Theory.

On problems about judicious bipartitions of graphs

Jie Ma, Xingxing Yu, Yuliang Ji, 2019, J. Comb. Theory, Ser. B.

Graph Connectivity After Path Removal

Xingxing Yu, Ronald J. Gould, Guantao Chen, 2003, Comb..

Approximate min-max relations on plane graphs

Jie Ma, Xingxing Yu, Wenan Zang, 2013, J. Comb. Optim..

Spanning paths in infinite planar graphs

Robin Thomas, Xingxing Yu, Nathaniel Dean, 1996, J. Graph Theory.

Graph-Based Path Selection and Power Allocation for DF Relay-Aided Transmission

Geoffrey Ye Li, Xingxing Yu, Lu Lu, 2018, IEEE Wireless Communications Letters.

Hamilton Cycles in Planar Locally Finite Graphs

Henning Bruhn, Xingxing Yu, Xingxing Yu, 2008, SIAM J. Discret. Math..

Five-Connected Toroidal Graphs Are Hamiltonian

Robin Thomas, Xingxing Yu, 1997, J. Comb. Theory, Ser. B.

On the reconstruction of planar graphs

Xingxing Yu, Young Soo Kwon, Mark Bilinski, 2007, J. Comb. Theory, Ser. B.

Graphs Containing Topological H

Jie Ma, Xingxing Yu, Qiqin Xie, 2016, J. Graph Theory.

Ulysses: a robust, low-diameter, low-latency peer-to-peer network

Abhishek Kumar, Ellen W. Zegura, Xingxing Yu, 2004, Eur. Trans. Telecommun..

Finding Four Independent Trees

Xingxing Yu, Orlando Lee, Sean Curran, 2006, SIAM J. Comput..

Energy-efficient resource allocation for cognitive radio networks

Geoffrey Ye Li, Xingxing Yu, Lu Lu, 2013, 2013 IEEE Global Communications Conference (GLOBECOM).

Trees and unicyclic graphs with hamiltonian path graphs

Xingxing Yu, 1990, J. Graph Theory.

Positively curved cubic plane graphs are finite

Xingxing Yu, Liang Sun, 2004, J. Graph Theory.

Contractible Cliques in k-Connected Graphs

Xingxing Yu, Zemin Jin, Xiaoyan Zhang, 2006, Graphs Comb..

Subdivisions of K5 in graphs containing K2, 3

Jie Ma, Ken-ichi Kawarabayashi, Xingxing Yu, 2015, J. Comb. Theory, Ser. B.

On several partitioning problems of Bollobás and Scott

Jie Ma, Xingxing Yu, Pei-Lan Yen, 2010, J. Comb. Theory, Ser. B.

Truncation for Low-Complexity MIMO Signal Detection

Geoffrey Ye Li, Xingxing Yu, Wen Jiang, 2007, IEEE Transactions on Information Theory.

Circumference of 3-connected cubic graphs

Qinghai Liu, Zhao Zhang, Xingxing Yu, 2017, J. Comb. Theory, Ser. B.

Long cycles in 3-connected graphs in orientable surfaces

Xingxing Yu, Laura Sheppardson, 2002, J. Graph Theory.

Graph-Based Robust Resource Allocation for Cognitive Radio Networks

Geoffrey Ye Li, Xingxing Yu, Lu Lu, 2014, IEEE Transactions on Signal Processing.

Nonseparating Planar Chains in 4-Connected Graphs

Xingxing Yu, Orlando Lee, Sean Curran, 2005, SIAM J. Discret. Math..

Approximating the Longest Cycle Problem on Graphs with Bounded Degree

Xingxing Yu, Zhicheng Gao, Wenan Zang, 2005, COCOON.

Triangle-free subcubic graphs with minimum bipartite density

Baogang Xu, Xingxing Yu, Baogang Xu, 2008, J. Comb. Theory B.

Bisections of Graphs Without Short Cycles

Xingxing Yu, Jianfeng Hou, Genghua Fan, 2017, Combinatorics, Probability and Computing.

Minimum codegree condition for perfect matchings in k-partite k-graphs

Xingxing Yu, Hongliang Lu, Yan Wang, 2019, J. Graph Theory.

On the fundamental tradeoffs between routing table size and network diameter in peer-to-peer networks

Abhishek Kumar, Xingxing Yu, Jun Xu, 2004, IEEE J. Sel. Areas Commun..

Approximating Longest Cycles in Graphs with Bounded Degrees

Xingxing Yu, Zhicheng Gao, Wenan Zang, 2006, SIAM J. Comput..

On Rainbow Matchings for Hypergraphs

Xingxing Yu, Hongliang Lu, 2018, SIAM J. Discret. Math..

Infinite paths in planar graphs I: Graphs with radial nets

Xingxing Yu, 2004, J. Graph Theory.

Contractible subgraphs in k-connected graphs

Xingxing Yu, Zemin Jin, Xiaoyan Zhang, 2007, J. Graph Theory.

Subdivisions in Planar Graphs

Xingxing Yu, 1998, J. Comb. Theory, Ser. B.

Balanced judicious bipartitions of graphs

Baogang Xu, Xingxing Yu, Juan Yan, 2010, J. Graph Theory.

Nonseparating Cycles in 4-Connected Graphs

Xingxing Yu, Sean Curran, 2003, SIAM J. Discret. Math..

Maximum Directed Cuts in Graphs with Degree Constraints

Baogang Xu, Xingxing Yu, Baogang Xu, 2012, Graphs Comb..

System Prediction of Drug-Drug Interactions Through the Integration of Drug Phenotypic, Therapeutic, Structural, and Genomic Similarities

Xingxing Yu, Xiaoyu Li, Chun-Hou Zheng, 2016, ICIC.

Claw-free graphs are edge reconstructible

Xingxing Yu, Mark N. Ellingham, László Pyber, 1988, J. Graph Theory.

Hamilton circles in infinite planar graphs

Jian Wang, Xingxing Yu, Qing Cui, 2009, J. Comb. Theory, Ser. B.

Counting Hamiltonian cycles in planar triangulations

Xingxing Yu, Xiaonan Liu, Zhiyu Wang, 2021 .

On the 3-colorability of triangle-free and fork-free graphs

Xingxing Yu, Zhiyu Wang, Joshua Schroeder, 2021, 2111.10469.

1-line minimum rectilinear steiner trees and related problems

Jianping Li, Xingxing Yu, Jean Yeh, 2021, Journal of Combinatorial Optimization.

Partitioning digraphs with outdegree at least 4

Xingxing Yu, Guanwu Liu, 2021, J. Graph Theory.

Number of Hamiltonian Cycles in Planar Triangulations

Xingxing Yu, Xiaonan Liu, 2021, SIAM J. Discret. Math..

A note on exact minimum degree threshold for fractional perfect matchings

Xingxing Yu, Hongliang Lu, 2021 .

Rainbow matchings for 3-uniform hypergraphs

Xingxing Yu, Hongliang Lu, Xiaofan Yuan, 2020, J. Comb. Theory, Ser. A.

Nearly Perfect Matchings in Uniform Hypergraphs

Xingxing Yu, Hongliang Lu, Xiaofan Yuan, 2019, SIAM J. Discret. Math..

On Tutte cycles containing three prescribed edges

Xingxing Yu, Michael C. Wigal, Xingxing Yu, 2021, 2106.09617.

Rainbow Perfect Matchings for 4-Uniform Hypergraphs

Yan Wang, Xingxing Yu, Hongliang Lu, 2021, SIAM J. Discret. Math..

Co-degree threshold for rainbow perfect matchings in uniform hypergraphs

Yan Wang, Xingxing Yu, Hongliang Lu, 2021, Journal of Combinatorial Theory, Series B.

Polynomial $\chi$-binding functions for $t$-broom-free graphs

Xingxing Yu, Xiaonan Liu, Zhiyu Wang, 2021 .

Approximating TSP walks in subcubic graphs pdf

Xingxing Yu, Michael C. Wigal, Youngho Yoo, 2021, J. Comb. Theory, Ser. B.

On the rainbow matching conjecture for 3-uniform hypergraphs

Xingxing Yu, Hongliang Lu, Jie Ma, 2021, Science China Mathematics.

Disjoint paths, planarizing cycles, and spanning walks

Xingxing Yu, Xingxing Yu, 1997 .

Title The circumference of a graph with no K 3 , t-minor

Xingxing Yu, Wenan Zang, Guantao Chen, 2006 .

Hamilton cycles in plane triangulations

Bill Jackson, Xingxing Yu, 2002 .

An asymptotically tight bound on the number of semi-algebraically connected components of realizable sign conditions

Baogang Xu, Xingxing Yu, Baogang Xu, 2009 .

Induced Forests in Bipartite Planar Graphs

Xingxing Yu, Yan Wang, Qiqin Xie, 2016 .

Disjoint Paths in Graphs III, Characterization

Xingxing Yu, Xingxing Yu, 2003 .

Non-Separating Paths in 4-Connected Graphs

Ken-ichi Kawarabayashi, Xingxing Yu, Orlando Lee, 2005 .

Disjoint Paths in Graphs II,A Special Case

Xingxing Yu, 2003 .

Maximum IPP Codes of Length 3

Xingxing Yu, Wen Jiang, Ye Li, 2010 .

Disjoint Paths in Graphs I,¶3-planar Graphs and Basic Obstructions

Xingxing Yu, 2003 .

The 3-connected graphs with a maximum matching containing precisely one contractible edge

Robert L. Hemminger, Xingxing Yu, Robert E. L. Aldred, 1994 .

4-Connected Projective-Planar Graphs Are Hamiltonian

Xingxing Yu, Robin Thomas, Xingxing Yu, 1994, J. Comb. Theory, Ser. B.

Positively curved cubic plane graphs are finite

Xingxing Yu, Liang Sun, 2004 .

Balanced judicious bipartitions of graphs

Baogang Xu, Xingxing Yu, Juan Yan, 2010 .