According to our database
1,
Xingxing Yu
authored at least 133 papers
between 1988 and 2024.
Collaborative distances:
2024
Linkages and removable paths avoiding vertices.
J. Comb. Theory B, 2024
A class of trees determined by their chromatic symmetric functions.
Discret. Math., 2024
2023
Co-degree threshold for rainbow perfect matchings in uniform hypergraphs.
J. Comb. Theory B, November, 2023
A better bound on the size of rainbow matchings.
J. Comb. Theory A, April, 2023
Time-Domain Numerical Simulation and Experimental Study on Pulsed Eddy Current Inspection of Tubing and Casing.
Sensors, February, 2023
Approximating TSP walks in subcubic graphs.
J. Comb. Theory B, 2023
Tutte paths and long cycles in circuit graphs.
J. Comb. Theory B, 2023
Polynomial <i>χ</i>-binding functions for <i>t</i>-broom-free graphs.
J. Comb. Theory B, 2023
2022
Rainbow Perfect Matchings for 4-Uniform Hypergraphs.
SIAM J. Discret. Math., 2022
4-Separations in Hajós graphs.
J. Graph Theory, 2022
Counting Hamiltonian cycles in planar triangulations.
J. Comb. Theory B, 2022
Approximation algorithms for constructing required subgraphs using stock pieces of fixed length.
J. Comb. Optim., 2022
1-line minimum rectilinear steiner trees and related problems.
J. Comb. Optim., 2022
A Note on Exact Minimum Degree Threshold for Fractional Perfect Matchings.
Graphs Comb., 2022
2021
A Novel Tensor Network for Tropical Cyclone Intensity Estimation.
IEEE Trans. Geosci. Remote. Sens., 2021
Nearly Perfect Matchings in Uniform Hypergraphs.
SIAM J. Discret. Math., 2021
Number of Hamiltonian Cycles in Planar Triangulations.
SIAM J. Discret. Math., 2021
Wheels in planar graphs and Hajós graphs.
J. Graph Theory, 2021
Partitioning digraphs with outdegree at least 4.
J. Graph Theory, 2021
Rainbow matchings for 3-uniform hypergraphs.
J. Comb. Theory A, 2021
2020
The Kelmans-Seymour conjecture IV: A proof.
J. Comb. Theory B, 2020
The Kelmans-Seymour conjecture III: 3-vertices in K4-.
J. Comb. Theory B, 2020
The Kelmans-Seymour conjecture II: 2-Vertices in K4-.
J. Comb. Theory B, 2020
The Kelmans-Seymour conjecture I: Special separations.
J. Comb. Theory B, 2020
7-Connected graphs are 4-ordered.
J. Comb. Theory B, 2020
Monochromatic Subgraphs in Iterated Triangulations.
Electron. J. Comb., 2020
A Regularized Tensor Network for Cyclone Wind Speed Estimation.
Proceedings of the IEEE International Geoscience and Remote Sensing Symposium, 2020
A Novel Deep Learning Framework for Tropical Cyclone Intensity Estimation Using FY-4 Satellite Imagery.
Proceedings of the ICIAI 2020: The 4th International Conference on Innovation in Artificial Intelligence, 2020
On Approximations for Constructing 1-Line Minimum Rectilinear Steiner Trees in the Euclidean Plane ℝ<sup>2</sup>.
Proceedings of the Algorithmic Aspects in Information and Management, 2020
2019
Minimum codegree condition for perfect matchings in k-partite k-graphs.
J. Graph Theory, 2019
On problems about judicious bipartitions of graphs.
J. Comb. Theory B, 2019
KL Divergence-Based Pheromone Fusion for Heterogeneous Multi-Colony Ant Optimization.
IEEE Access, 2019
A Semisupervised Deep Learning Framework for Tropical Cyclone Intensity Estimation.
Proceedings of the 10th International Workshop on the Analysis of Multitemporal Remote Sensing Images, 2019
A Tensor Network for Tropical Cyclone Wind Speed Estimation.
Proceedings of the 2019 IEEE International Geoscience and Remote Sensing Symposium, 2019
On Approximations for Constructing Required Subgraphs Using Stock Pieces of Fixed Length.
Proceedings of the Algorithmic Aspects in Information and Management, 2019
2018
Graph-Based Path Selection and Power Allocation for DF Relay-Aided Transmission.
IEEE Wirel. Commun. Lett., 2018
Graph-Based Resource Sharing in Vehicular Communication.
IEEE Trans. Wirel. Commun., 2018
On Rainbow Matchings for Hypergraphs.
SIAM J. Discret. Math., 2018
Almost Perfect Matchings in k-Partite k-Graphs.
SIAM J. Discret. Math., 2018
Disjoint perfect matchings in 3-uniform hypergraphs.
J. Graph Theory, 2018
Circumference of 3-connected cubic graphs.
J. Comb. Theory B, 2018
Bisections of Graphs Without Short Cycles.
Comb. Probab. Comput., 2018
Graph-Based Radio Resource Management for Vehicular Networks.
Proceedings of the 2018 IEEE International Conference on Communications, 2018
2016
Graphs Containing Topological <i>H</i>.
J. Graph Theory, 2016
On a Coloring Conjecture of Hajós.
Graphs Comb., 2016
On judicious bipartitions of graphs.
Comb., 2016
Graph-based path selection and power allocation for relay-aided transmission.
Proceedings of the IEEE Wireless Communications and Networking Conference, 2016
System Prediction of Drug-Drug Interactions Through the Integration of Drug Phenotypic, Therapeutic, Structural, and Genomic Similarities.
Proceedings of the Intelligent Computing Theories and Application, 2016
2015
Graph-Based Robust Resource Allocation for Cognitive Radio Networks.
IEEE Trans. Signal Process., 2015
Nonseparating Cycles Avoiding Specific Vertices.
J. Graph Theory, 2015
Subdivisions of <sub>K</sub><sub>5</sub> in graphs containing <sub>K</sub><sub>2</sub><sub>, </sub><sub>3</sub>.
J. Comb. Theory B, 2015
On Tight Components and Anti-Tight Components.
Graphs Comb., 2015
2014
Forbidden Subgraphs and 3-Colorings.
SIAM J. Discret. Math., 2014
On judicious bisections of graphs.
J. Comb. Theory B, 2014
2013
K<sub>5</sub>-Subdivisions in graphs containing K<sup>-</sup><sub>4</sub>.
J. Comb. Theory B, 2013
Approximate min-max relations on plane graphs.
J. Comb. Optim., 2013
Energy-efficient resource allocation for cognitive radio networks.
Proceedings of the 2013 IEEE Global Communications Conference, 2013
2012
Partitioning 3-uniform hypergraphs.
J. Comb. Theory B, 2012
The circumference of a graph with no K<sub>3, t</sub>-minor, II.
J. Comb. Theory B, 2012
Bonds with parity constraints.
J. Comb. Theory B, 2012
Maximum Directed Cuts in Graphs with Degree Constraints.
Graphs Comb., 2012
Upper bounds on minimum balanced bipartitions.
Discret. Math., 2012
2011
Circumference of 3-connected claw-free graphs and large Eulerian subgraphs of 3-edge-connected graphs.
J. Comb. Theory B, 2011
Approximating the chromatic index of multigraphs.
J. Comb. Optim., 2011
Better Bounds for <i>k</i>-Partitions of Graphs.
Comb. Probab. Comput., 2011
2010
Balanced judicious bipartitions of graphs.
J. Graph Theory, 2010
On several partitioning problems of Bollobás and Scott.
J. Comb. Theory B, 2010
Independent paths and K<sub>5</sub>-subdivisions.
J. Comb. Theory B, 2010
A note on balanced bipartitions.
Discret. Math., 2010
Bounds for pairs in partitions of graphs.
Discret. Math., 2010
2009
Judicious k-partitions of graphs.
J. Comb. Theory B, 2009
Hamilton circles in infinite planar graphs.
J. Comb. Theory B, 2009
On a bipartition problem of Bollobás and Scott.
Comb., 2009
2008
Hamilton Cycles in Planar Locally Finite Graphs.
SIAM J. Discret. Math., 2008
Infinite paths in planar graphs V, 3-indivisible graphs.
J. Graph Theory, 2008
Triangle-free subcubic graphs with minimum bipartite density.
J. Comb. Theory B, 2008
2007
Truncation for Low-Complexity MIMO Signal Detection.
IEEE Trans. Inf. Theory, 2007
Contractible subgraphs in <i>k</i>-connected graphs.
J. Graph Theory, 2007
On the reconstruction of planar graphs.
J. Comb. Theory B, 2007
2006
Finding Four Independent Trees .
SIAM J. Comput., 2006
Approximating Longest Cycles in Graphs with Bounded Degrees.
SIAM J. Comput., 2006
Infinite paths in planar graphs IV, dividing cycles.
J. Graph Theory, 2006
Infinite paths in planar graphs III, 1-way infinite paths.
J. Graph Theory, 2006
Reducing Hajós' 4-coloring conjecture to 4-connected graphs.
J. Comb. Theory B, 2006
The circumference of a graph with no K<sub>3, t</sub>-minor.
J. Comb. Theory B, 2006
Contractible Cliques in <i>k</i>-Connected Graphs.
Graphs Comb., 2006
Erratum to 2-walks in 3-connected planar graphs.
Australas. J Comb., 2006
2005
Chain Decompositions of 4-Connected Graphs.
SIAM J. Discret. Math., 2005
Nonseparating Planar Chains in 4-Connected Graphs.
SIAM J. Discret. Math., 2005
Infinite paths in planar graphs II, structures and ladder nets.
J. Graph Theory, 2005
Hamilton paths in toroidal graphs.
J. Comb. Theory B, 2005
Covering planar graphs with forests.
J. Comb. Theory B, 2005
Approximating the Longest Cycle Problem on Graphs with Bounded Degree.
Proceedings of the Computing and Combinatorics, 11th Annual International Conference, 2005
2004
Circumference of Graphs with Bounded Degree.
SIAM J. Comput., 2004
On the fundamental tradeoffs between routing table size and network diameter in peer-to-peer networks.
IEEE J. Sel. Areas Commun., 2004
Infinite paths in planar graphs I: Graphs with radial nets.
J. Graph Theory, 2004
Positively curved cubic plane graphs are finite.
J. Graph Theory, 2004
Ulysses: a robust, low-diameter, low-latency peer-to-peer network.
Eur. Trans. Telecommun., 2004
Cycles in 4-connected planar graphs.
Eur. J. Comb., 2004
Bi-truncation for simplified MIMO signal detection.
Proceedings of the Global Telecommunications Conference, 2004. GLOBECOM '04, Dallas, Texas, USA, 29 November, 2004
2003
Nonseparating Cycles in 4-Connected Graphs.
SIAM J. Discret. Math., 2003
Graph Connectivity After Path Removal.
Comb., 2003
Chain decompositions and independent trees in 4-connected graphs.
Proceedings of the Fourteenth Annual ACM-SIAM Symposium on Discrete Algorithms, 2003
Ulysses: A Robust, Low-Diameter, Low-Latency Peer-ti-Peer Network.
Proceedings of the 11th IEEE International Conference on Network Protocols (ICNP 2003), 2003
2002
Long cycles in 3-connected graphs in orientable surfaces.
J. Graph Theory, 2002
Hamilton cycles in plane triangulations.
J. Graph Theory, 2002
Long Cycles in 3-Connected Graphs.
J. Comb. Theory B, 2002
A note on fragile graphs.
Discret. Math., 2002
1998
Subdivisions in Planar Graphs.
J. Comb. Theory B, 1998
Tutte cycles in circuit graphs.
Discret. Math., 1998
1997
Five-Connected Toroidal Graphs Are Hamiltonian.
J. Comb. Theory B, 1997
Convex Programming and Circumference of 3-Connected Graphs of Low Genus.
J. Comb. Theory B, 1997
1996
Spanning paths in infinite planar graphs.
J. Graph Theory, 1996
1995
Non-Contractible Edges in A 3-Connected Graph.
Comb., 1995
2-walks in 3-connected planar graphs.
Australas. J Comb., 1995
1994
3-connected graphs with non-cut contractible edge covers of size <i>k</i>.
J. Graph Theory, 1994
On hamiltonian-connected graphs.
J. Graph Theory, 1994
4-Connected Projective-Planar Graphs Are Hamiltonian.
J. Comb. Theory B, 1994
Small Circuit Double Covers of Cubic Multigraphs.
J. Comb. Theory B, 1994
Independence ratios of graph powers.
Discret. Math., 1994
1993
Covering contractible edges in 3-connected graphs. II. Characterizing those with covers of size three.
J. Graph Theory, 1993
1992
Non-separating cycles and discrete Jordan curves.
J. Comb. Theory B, 1992
Cyclomatic numbers of connected induced subgraphs.
Discret. Math., 1992
On several symmetry conditions for graphs.
Discret. Math., 1992
On 3-connected graphs with contractible edge covers of size k.
Discret. Math., 1992
Maximum matchings in 3-connected graphs contain contractible edges.
Australas. J Comb., 1992
1991
On the cycle-isomorphism of graphs.
J. Graph Theory, 1991
1990
Trees and unicyclic graphs with hamiltonian path graphs.
J. Graph Theory, 1990
On neighbourhood line graphs.
Discret. Math., 1990
1988
Claw-free graphs are edge reconstructible.
J. Graph Theory, 1988
