Xingxing Yu

Comb. Probab. Comput., 2026

2025

On Tutte Cycles Containing Three Prescribed Edges.

[BibT_eX]

[DOI]

Michael C. Wigal

Graphs Comb., February, 2025

Dense circuit graphs and the planar Turán number of a cycle.

[BibT_eX]

[DOI]

Ruilin Shi

Zach Walsh

J. Graph Theory, January, 2025

Planar Turán number of the 7-cycle.

[BibT_eX]

[DOI]

Ruilin Shi

Zach Walsh

Eur. J. Comb., 2025

2024

Linkages and removable paths avoiding vertices.

[BibT_eX]

[DOI]

J. Comb. Theory B, 2024

A class of trees determined by their chromatic symmetric functions.

[BibT_eX]

[DOI]

Yuzhenni Wang

Xiao-Dong Zhang

Discret. Math., 2024

2023

Co-degree threshold for rainbow perfect matchings in uniform hypergraphs.

[BibT_eX]

[DOI]

J. Comb. Theory B, November, 2023

A better bound on the size of rainbow matchings.

[BibT_eX]

[DOI]

J. Comb. Theory A, April, 2023

Time-Domain Numerical Simulation and Experimental Study on Pulsed Eddy Current Inspection of Tubing and Casing.

[BibT_eX]

[DOI]

Sensors, February, 2023

Approximating TSP walks in subcubic graphs.

[BibT_eX]

[DOI]

Michael C. Wigal

Youngho Yoo

J. Comb. Theory B, 2023

Tutte paths and long cycles in circuit graphs.

[BibT_eX]

[DOI]

Michael C. Wigal

J. Comb. Theory B, 2023

Polynomial χ-binding functions for t-broom-free graphs.

[BibT_eX]

[DOI]

J. Comb. Theory B, 2023

2022

Rainbow Perfect Matchings for 4-Uniform Hypergraphs.

[BibT_eX]

[DOI]

SIAM J. Discret. Math., 2022

4-Separations in Hajós graphs.

[BibT_eX]

[DOI]

J. Graph Theory, 2022

Counting Hamiltonian cycles in planar triangulations.

[BibT_eX]

[DOI]

Xiaonan Liu

Zhiyu Wang

J. Comb. Theory B, 2022

Approximation algorithms for constructing required subgraphs using stock pieces of fixed length.

[BibT_eX]

[DOI]

J. Comb. Optim., 2022

1-line minimum rectilinear steiner trees and related problems.

[BibT_eX]

[DOI]

J. Comb. Optim., 2022

A Note on Exact Minimum Degree Threshold for Fractional Perfect Matchings.

[BibT_eX]

[DOI]

Graphs Comb., 2022

2021

A Novel Tensor Network for Tropical Cyclone Intensity Estimation.

[BibT_eX]

[DOI]

Zhao Chen

IEEE Trans. Geosci. Remote. Sens., 2021

Nearly Perfect Matchings in Uniform Hypergraphs.

[BibT_eX]

[DOI]

Xiaofan Yuan

SIAM J. Discret. Math., 2021

Number of Hamiltonian Cycles in Planar Triangulations.

[BibT_eX]

[DOI]

Xiaonan Liu

SIAM J. Discret. Math., 2021

Wheels in planar graphs and Hajós graphs.

[BibT_eX]

[DOI]

J. Graph Theory, 2021

Partitioning digraphs with outdegree at least 4.

[BibT_eX]

[DOI]

Guanwu Liu

J. Graph Theory, 2021

Rainbow matchings for 3-uniform hypergraphs.

[BibT_eX]

[DOI]

Xiaofan Yuan

J. Comb. Theory A, 2021

2020

The Kelmans-Seymour conjecture IV: A proof.

[BibT_eX]

[DOI]

J. Comb. Theory B, 2020

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

[BibT_eX]

[DOI]

J. Comb. Theory B, 2020

The Kelmans-Seymour conjecture II: 2-Vertices in K4-.

[BibT_eX]

[DOI]

J. Comb. Theory B, 2020

The Kelmans-Seymour conjecture I: Special separations.

[BibT_eX]

[DOI]

J. Comb. Theory B, 2020

7-Connected graphs are 4-ordered.

[BibT_eX]

[DOI]

Rose McCarty

J. Comb. Theory B, 2020

Monochromatic Subgraphs in Iterated Triangulations.

[BibT_eX]

[DOI]

Tianyun Tang

Electron. J. Comb., 2020

A Regularized Tensor Network for Cyclone Wind Speed Estimation.

[BibT_eX]

[DOI]

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.

[BibT_eX]

[DOI]

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 ℝ2.

[BibT_eX]

[DOI]

Proceedings of the Algorithmic Aspects in Information and Management, 2020

2019

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

[BibT_eX]

[DOI]

J. Graph Theory, 2019

On problems about judicious bipartitions of graphs.

[BibT_eX]

[DOI]

J. Comb. Theory B, 2019

KL Divergence-Based Pheromone Fusion for Heterogeneous Multi-Colony Ant Optimization.

[BibT_eX]

[DOI]

IEEE Access, 2019

A Semisupervised Deep Learning Framework for Tropical Cyclone Intensity Estimation.

[BibT_eX]

[DOI]

Proceedings of the 10th International Workshop on the Analysis of Multitemporal Remote Sensing Images, 2019

A Tensor Network for Tropical Cyclone Wind Speed Estimation.

[BibT_eX]

[DOI]

Proceedings of the 2019 IEEE International Geoscience and Remote Sensing Symposium, 2019

On Approximations for Constructing Required Subgraphs Using Stock Pieces of Fixed Length.

[BibT_eX]

[DOI]

Proceedings of the Algorithmic Aspects in Information and Management, 2019

2018

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

[BibT_eX]

[DOI]

IEEE Wirel. Commun. Lett., 2018

Graph-Based Resource Sharing in Vehicular Communication.

[BibT_eX]

[DOI]

IEEE Trans. Wirel. Commun., 2018

On Rainbow Matchings for Hypergraphs.

[BibT_eX]

[DOI]

SIAM J. Discret. Math., 2018

Almost Perfect Matchings in k-Partite k-Graphs.

[BibT_eX]

[DOI]

SIAM J. Discret. Math., 2018

Disjoint perfect matchings in 3-uniform hypergraphs.

[BibT_eX]

[DOI]

Li Zhang

J. Graph Theory, 2018

Circumference of 3-connected cubic graphs.

[BibT_eX]

[DOI]

Qinghai Liu

Zhao Zhang

J. Comb. Theory B, 2018

Bisections of Graphs Without Short Cycles.

[BibT_eX]

[DOI]

Genghua Fan

Jianfeng Hou

Comb. Probab. Comput., 2018

Graph-Based Radio Resource Management for Vehicular Networks.

[BibT_eX]

[DOI]

Proceedings of the 2018 IEEE International Conference on Communications, 2018

2016

Graphs Containing Topological H.

[BibT_eX]

[DOI]

Qiqin Xie

J. Graph Theory, 2016

On a Coloring Conjecture of Hajós.

[BibT_eX]

[DOI]

Yuqin Sun

Graphs Comb., 2016

On judicious bipartitions of graphs.

[BibT_eX]

[DOI]

Comb., 2016

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

[BibT_eX]

[DOI]

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.

[BibT_eX]

[DOI]

Proceedings of the Intelligent Computing Theories and Application, 2016

2015

Nonseparating Cycles Avoiding Specific Vertices.

[BibT_eX]

[DOI]

Yanmei Hong

Liying Kang

J. Graph Theory, 2015

Subdivisions of K5 in graphs containing K2, 3.

[BibT_eX]

[DOI]

Ken-ichi Kawarabayashi

J. Comb. Theory B, 2015

On Tight Components and Anti-Tight Components.

[BibT_eX]

[DOI]

Changhong Lu

Kan Wang

Graphs Comb., 2015

2014

Forbidden Subgraphs and 3-Colorings.

[BibT_eX]

[DOI]

SIAM J. Discret. Math., 2014

On judicious bisections of graphs.

[BibT_eX]

[DOI]

J. Comb. Theory B, 2014

Graph-based robust resource allocation for cognitive radio networks.

[BibT_eX]

[DOI]

Proceedings of the IEEE International Conference on Acoustics, 2014

2013

K5-Subdivisions in graphs containing K-4.

[BibT_eX]

[DOI]

J. Comb. Theory B, 2013

Approximate min-max relations on plane graphs.

[BibT_eX]

[DOI]

J. Comb. Optim., 2013

Energy-efficient resource allocation for cognitive radio networks.

[BibT_eX]

[DOI]

Proceedings of the 2013 IEEE Global Communications Conference, 2013

2012

Partitioning 3-uniform hypergraphs.

[BibT_eX]

[DOI]

J. Comb. Theory B, 2012

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

[BibT_eX]

[DOI]

J. Comb. Theory B, 2012

Bonds with parity constraints.

[BibT_eX]

[DOI]

J. Comb. Theory B, 2012

Maximum Directed Cuts in Graphs with Degree Constraints.

[BibT_eX]

[DOI]

Graphs Comb., 2012

Upper bounds on minimum balanced bipartitions.

[BibT_eX]

[DOI]

Discret. Math., 2012

2011

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

[BibT_eX]

[DOI]

J. Comb. Theory B, 2011

Approximating the chromatic index of multigraphs.

[BibT_eX]

[DOI]

J. Comb. Optim., 2011

Better Bounds for k-Partitions of Graphs.

[BibT_eX]

[DOI]

Comb. Probab. Comput., 2011

2010

Balanced judicious bipartitions of graphs.

[BibT_eX]

[DOI]

Juan Yan

J. Graph Theory, 2010

On several partitioning problems of Bollobás and Scott.

[BibT_eX]

[DOI]

Pei-Lan Yen

J. Comb. Theory B, 2010

Independent paths and K5-subdivisions.

[BibT_eX]

[DOI]

J. Comb. Theory B, 2010

A note on balanced bipartitions.

[BibT_eX]

[DOI]

Juan Yan

Discret. Math., 2010

Bounds for pairs in partitions of graphs.

[BibT_eX]

[DOI]

Discret. Math., 2010

2009

Judicious k-partitions of graphs.

[BibT_eX]

[DOI]

J. Comb. Theory B, 2009

Hamilton circles in infinite planar graphs.

[BibT_eX]

[DOI]

Qing Cui

Jian Wang

J. Comb. Theory B, 2009

Preface.

[BibT_eX]

[DOI]

Discret. Math., 2009

On a bipartition problem of Bollobás and Scott.

[BibT_eX]

[DOI]

Comb., 2009

2008

Hamilton Cycles in Planar Locally Finite Graphs.

[BibT_eX]

[DOI]

Henning Bruhn

SIAM J. Discret. Math., 2008

Infinite paths in planar graphs V, 3-indivisible graphs.

[BibT_eX]

[DOI]

J. Graph Theory, 2008

Triangle-free subcubic graphs with minimum bipartite density.

[BibT_eX]

[DOI]

J. Comb. Theory B, 2008

2007

Truncation for Low-Complexity MIMO Signal Detection.

[BibT_eX]

[DOI]

Wen Jiang

Geoffrey Ye Li

IEEE Trans. Inf. Theory, 2007

Contractible subgraphs in k-connected graphs.

[BibT_eX]

[DOI]

Zemin Jin

Xiaoyan Zhang

J. Graph Theory, 2007

On the reconstruction of planar graphs.

[BibT_eX]

[DOI]

Mark Bilinski

Young Soo Kwon

J. Comb. Theory B, 2007

2006

Finding Four Independent Trees .

[BibT_eX]

[DOI]

SIAM J. Comput., 2006

Approximating Longest Cycles in Graphs with Bounded Degrees.

[BibT_eX]

[DOI]

SIAM J. Comput., 2006

Infinite paths in planar graphs IV, dividing cycles.

[BibT_eX]

[DOI]

J. Graph Theory, 2006

Infinite paths in planar graphs III, 1-way infinite paths.

[BibT_eX]

[DOI]

J. Graph Theory, 2006

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

[BibT_eX]

[DOI]

Florian Zickfeld

J. Comb. Theory B, 2006

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

[BibT_eX]

[DOI]

J. Comb. Theory B, 2006

Contractible Cliques in k-Connected Graphs.

[BibT_eX]

[DOI]

Graphs Comb., 2006

Erratum to 2-walks in 3-connected planar graphs.

[BibT_eX]

[DOI]

R. Bruce Richter

Australas. J Comb., 2006

2005

Chain Decompositions of 4-Connected Graphs.

[BibT_eX]

[DOI]

SIAM J. Discret. Math., 2005

Nonseparating Planar Chains in 4-Connected Graphs.

[BibT_eX]

[DOI]

SIAM J. Discret. Math., 2005

Infinite paths in planar graphs II, structures and ladder nets.

[BibT_eX]

[DOI]

J. Graph Theory, 2005

Hamilton paths in toroidal graphs.

[BibT_eX]

[DOI]

J. Comb. Theory B, 2005

Covering planar graphs with forests.

[BibT_eX]

[DOI]

J. Comb. Theory B, 2005

Approximating the Longest Cycle Problem on Graphs with Bounded Degree.

[BibT_eX]

[DOI]

Proceedings of the Computing and Combinatorics, 11th Annual International Conference, 2005

2004

Circumference of Graphs with Bounded Degree.

[BibT_eX]

[DOI]

Jun Xu

SIAM J. Comput., 2004

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

[BibT_eX]

[DOI]

Jun (Jim) Xu

Abhishek Kumar

IEEE J. Sel. Areas Commun., 2004

Infinite paths in planar graphs I: Graphs with radial nets.

[BibT_eX]

[DOI]

J. Graph Theory, 2004

Positively curved cubic plane graphs are finite.

[BibT_eX]

[DOI]

Liang Sun

J. Graph Theory, 2004

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

[BibT_eX]

[DOI]

Eur. Trans. Telecommun., 2004

Cycles in 4-connected planar graphs.

[BibT_eX]

[DOI]

Genghua Fan

Eur. J. Comb., 2004

Bi-truncation for simplified MIMO signal detection.

[BibT_eX]

[DOI]

Wen Jiang

Geoffrey Ye Li

Proceedings of the Global Telecommunications Conference, 2004. GLOBECOM '04, Dallas, Texas, USA, 29 November, 2004

2003

Nonseparating Cycles in 4-Connected Graphs.

[BibT_eX]

[DOI]

SIAM J. Discret. Math., 2003

Graph Connectivity After Path Removal.

[BibT_eX]

[DOI]

Ronald J. Gould

Comb., 2003

Chain decompositions and independent trees in 4-connected graphs.

[BibT_eX]

[DOI]

Proceedings of the Fourteenth Annual ACM-SIAM Symposium on Discrete Algorithms, 2003

Ulysses: A Robust, Low-Diameter, Low-Latency Peer-ti-Peer Network.

[BibT_eX]

[DOI]

Proceedings of the 11th IEEE International Conference on Network Protocols (ICNP 2003), 2003

2002

Long cycles in 3-connected graphs in orientable surfaces.

[BibT_eX]

[DOI]

Laura Sheppardson

J. Graph Theory, 2002

Hamilton cycles in plane triangulations.

[BibT_eX]

[DOI]

Bill Jackson

J. Graph Theory, 2002

Long Cycles in 3-Connected Graphs.

[BibT_eX]

[DOI]

J. Comb. Theory B, 2002

A note on fragile graphs.

[BibT_eX]

[DOI]

Discret. Math., 2002

1998

Subdivisions in Planar Graphs.

[BibT_eX]

[DOI]

J. Comb. Theory B, 1998

Tutte cycles in circuit graphs.

[BibT_eX]

[DOI]

Discret. Math., 1998

1997

Five-Connected Toroidal Graphs Are Hamiltonian.

[BibT_eX]

[DOI]

J. Comb. Theory B, 1997

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

[BibT_eX]

[DOI]

J. Comb. Theory B, 1997

1996

Spanning paths in infinite planar graphs.

[BibT_eX]

[DOI]

Nathaniel Dean

J. Graph Theory, 1996

1995

Non-Contractible Edges in A 3-Connected Graph.

[BibT_eX]

[DOI]

Comb., 1995

2-walks in 3-connected planar graphs.

[BibT_eX]

[DOI]

R. Bruce Richter

Australas. J Comb., 1995

1994

3-connected graphs with non-cut contractible edge covers of size k.

[BibT_eX]

[DOI]

J. Graph Theory, 1994

On hamiltonian-connected graphs.

[BibT_eX]

[DOI]

Ronald J. Gould

J. Graph Theory, 1994

4-Connected Projective-Planar Graphs Are Hamiltonian.

[BibT_eX]

[DOI]

J. Comb. Theory B, 1994

Small Circuit Double Covers of Cubic Multigraphs.

[BibT_eX]

[DOI]

Hong-Jian Lai

Cun-Quan Zhang

J. Comb. Theory B, 1994

Independence ratios of graph powers.

[BibT_eX]

[DOI]

Pavol Hell

Huishan Zhou

Discret. Math., 1994

1993

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

[BibT_eX]

[DOI]

Robert L. Hemminger

J. Graph Theory, 1993

1992

Non-separating cycles and discrete Jordan curves.

[BibT_eX]

[DOI]

J. Comb. Theory B, 1992

Cyclomatic numbers of connected induced subgraphs.

[BibT_eX]

[DOI]

Discret. Math., 1992

Ends in spanning trees.

[BibT_eX]

[DOI]

Discret. Math., 1992

On several symmetry conditions for graphs.

[BibT_eX]

[DOI]

Discret. Math., 1992

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

[BibT_eX]

[DOI]

Robert L. Hemminger

Discret. Math., 1992

On a problem of Hendry.

[BibT_eX]

[DOI]

M. R. Hart

Discret. Math., 1992

Maximum matchings in 3-connected graphs contain contractible edges.

[BibT_eX]

[DOI]

Robert E. L. Aldred

Robert L. Hemminger

Australas. J Comb., 1992

1991

On the cycle-isomorphism of graphs.

[BibT_eX]

[DOI]

J. Graph Theory, 1991

1990

Trees and unicyclic graphs with hamiltonian path graphs.

[BibT_eX]

[DOI]

J. Graph Theory, 1990

On neighbourhood line graphs.

[BibT_eX]

[DOI]

Discret. Math., 1990

1988

Claw-free graphs are edge reconstructible.

[BibT_eX]

[DOI]

Mark N. Ellingham

László Pyber