Haidong Wu

According to our database1, Haidong Wu authored at least 37 papers between 1995 and 2022.

Collaborative distances:
  • Dijkstra number2 of four.
  • Erdős number3 of two.

Timeline

Legend:

Book 
In proceedings 
Article 
PhD thesis 
Other 

Links

On csauthors.net:

Bibliography

2022
Bounding the beta invariant of 3-connected matroids.
Discret. Math., 2022

2020
Trajectory Tracking Control for Four-Wheel Independent Drive Intelligent Vehicle Based on Model Predictive Control.
IEEE Access, 2020

2019
Transformer Image Recognition System Based on Deep Learning.
Proceedings of the 6th International Conference on Systems and Informatics, 2019

2018
Modeling Gross Primary Production of a Typical Coastal Wetland in China Using MODIS Time Series and CO<sub>2</sub> Eddy Flux Tower Data.
Remote. Sens., 2018

2016
Large Wk- or K3, t-Minors in 3-Connected Graphs.
J. Graph Theory, 2016

2015
Characterizing binary matroids with no P9-minor.
Adv. Appl. Math., 2015

2012
Bounding the coefficients of the characteristic polynomials of simple binary matroids.
Discret. Math., 2012

2011
On the circuit-spectrum of binary matroids.
Eur. J. Comb., 2011

Obstructions to a binary matroid being graphic.
Eur. J. Comb., 2011

2010
Characterizing 3-connected planar graphs and graphic matroids.
J. Graph Theory, 2010

Clonal sets in GF(q)-representable matroids.
Discret. Math., 2010

2009
On Tutte polynomial uniqueness of twisted wheels.
Discret. Math., 2009

On minor-minimally 3-connected binary matroids.
Discret. Math., 2009

2008
On minimally k-connected matroids.
J. Comb. Theory, Ser. B, 2008

Minimally 3-connected binary matroids.
Eur. J. Comb., 2008

On deletions of largest bonds in graphs.
Discret. Math., 2008

On chromatic and flow polynomial unique graphs.
Discret. Appl. Math., 2008

2006
An Extremal Problem on Contractible Edges in 3-Connected Graphs.
Graphs Comb., 2006

2005
Distribution of contractible elements in 2-connected matroids.
Discret. Math., 2005

Chords in graphs.
Australas. J Comb., 2005

Largest circuits in matroids.
Adv. Appl. Math., 2005

2004
The 3-Connected Graphs with Exactly Three Non-Essential Edges.
Graphs Comb., 2004

On contractible edges in 3-connected graphs.
Australas. J Comb., 2004

2003
Contractible Elements in Graphs and Matroids.
Comb. Probab. Comput., 2003

2002
On elements in small cocircuits in minimally k-connected graphs and matroids.
Discret. Math., 2002

On the use of lattice algorithm for adaptive antennas.
Proceedings of the IEEE International Conference on Communications, 2002

2001
A Generalization of a Theorem of Dirac.
J. Comb. Theory, Ser. B, 2001

On Minimally 3-Connected Binary Matroids.
Comb. Probab. Comput., 2001

2000
Connected Hyperplanes in Binary Matroids.
J. Comb. Theory, Ser. B, 2000

On Non-Essential Edges in 3-Connected Graphs.
Graphs Comb., 2000

Matroids and Graphs with Few Non-Essential Elements.
Graphs Comb., 2000

On the Structure of 3-connected Matroids and Graphs.
Eur. J. Comb., 2000

1999
A non-planar version of Tutte's wheels theorem.
Australas. J Comb., 1999

1998
On contractible and vertically contractible elements in 3-connected matroids and graphs.
Discret. Math., 1998

On Vertex-Triads in 3-Connected Binary Matroids.
Comb. Probab. Comput., 1998

1997
A Longest Cycle Version of Tutte's Wheels Theorem.
J. Comb. Theory, Ser. B, 1997

1995
On matroid connectivity.
Discret. Math., 1995


  Loading...