Haidong Wu

Follow

Generating author description...

All published works
Action Title Year Authors
+ PDF Chat Bonds Intersecting Long Paths in \(k\) -Connected Graphs 2023 Qinghong Zhao
Bing Wei
Haidong Wu
+ Bounding the beta invariant of 3-connected matroids 2021 Soo‐Yeon Lee
Haidong Wu
+ Beta invariant and chromatic uniqueness of wheels 2021 Soo‐Yeon Lee
Haidong Wu
+ Large ‐ or ‐Minors in 3‐Connected Graphs 2015 Guoli Ding
Stan Dziobiak
Haidong Wu
+ PDF Chat Characterizing binary matroids with no<mml:math xmlns:mml="http://www.w3.org/1998/Math/MathML" altimg="si1.gif" overflow="scroll"><mml:msub><mml:mrow><mml:mi>P</mml:mi></mml:mrow><mml:mrow><mml:mn>9</mml:mn></mml:mrow></mml:msub></mml:math>-minor 2015 Guoli Ding
Haidong Wu
+ Characterizing binary matroids with no $P_9$-minor 2014 Guoli Ding
Haidong Wu
+ Bounding the coefficients of the characteristic polynomials of simple binary matroids 2012 Loni Delaplane
Haidong Wu
+ On minimally k-connected matroids 2008 Talmage James Reid
Haidong Wu
Xiangqian Zhou
+ On Tutte polynomial uniqueness of twisted wheels 2008 Yinghua Duan
Haidong Wu
Qinglin Yu
+ On chromatic and flow polynomial unique graphs 2008 Yinghua Duan
Haidong Wu
Qinglin Yu
+ On deletions of largest bonds in graphs 2007 Nolan Mcmurray
Talmage James Reid
Laura Sheppardson
Bing Wei
Haidong Wu
+ On elements in small cocircuits in minimally k-connected graphs and matroids 2002 Talmage James Reid
Haidong Wu
+ A Generalization of a Theorem of Dirac 2001 Tristan Denley
Haidong Wu
+ A non-planar version of Tutte's wheels theorem. 1999 Talmage James Reid
Haidong Wu
Common Coauthors
Commonly Cited References
Action Title Year Authors # of times referenced
+ The Tutte Polynomial and Its Applications 1992 Thomas Brylawski
James Oxley
3
+ PDF Chat Locally grid graphs: classification and Tutte uniqueness 2003 Alberto MĂĄrquez
Anna de Mier
Marc Noy
M.P. Revuelta
2
+ On Graphs Determined by Their Tutte Polynomials 2004 Anna de Mier
Marc Noy
2
+ PDF Chat Modular constructions for combinatorial geometries 1975 Tom Brylawski
2
+ Tutte uniqueness of line graphs 2005 Anna de Mier
Marc Noy
2
+ PDF Chat A Contribution to the Theory of Chromatic Polynomials 1954 W. T. Tutte
2
+ Bonds Intersecting Cycles In A Graph 2005 Sean McGuinness
1
+ The search for chromatically unique graphs 1990 K. M. Koh
K. L. Teo
1
+ PDF Chat A decomposition for combinatorial geometries 1972 Thomas Brylawski
1
+ Circuits through specified edges 1982 Roland HĂ€ggkvist
Carsten Thomassen
1
+ Contraction–Deletion Invariants for Graphs 2000 BĂ©la BollobĂĄs
Luke Pebody
Oliver Riordan
1
+ Some matroid inequalities 1980 Anders Björner
1
+ The internally 4-connected binary matroids with no M(K3,3)-minor 2009 Dillon Mayhew
Gordon Royle
Geoff Whittle
1
+ Intersecting longest paths 2013 Susanna F. de Rezende
Cristina G. Fernandes
Daniel M. Martin
Yoshiko Wakabayashi
1
+ On chromatic and flow polynomial unique graphs 2008 Yinghua Duan
Haidong Wu
Qinglin Yu
1
+ Longest cycles in 3-connected cubic graphs 1986 Bill Jackson
1
+ PDF Chat A Decomposition Theorem for Binary Matroids with no Prism Minor 2013 S. R. Kingan
Manoel Lemos
1
+ PDF Chat On the foundations of combinatorial theory I. Theory of Mïżœbius Functions 1964 Gian Carlo Rota
1
+ A higher invariant for matroids 1967 Henry Crapo
1
+ PDF Chat A combinatorial model for series-parallel networks 1971 Thomas Brylawski
1
+ Planar and infinite hypohamiltonian and hypotraceable graphs 1976 Carsten Thomassen
1
+ In abstrakten Graphen vorhandene vollstĂ€ndige 4‐Graphen und ihre Unterteilungen 1960 G. A. Dirac
1
+ Bounds for the coefficients of flow polynomials 2006 Fengming Dong
K.M. Koh
1
+ A matroid generalization of a result of Dirac 1997 James Oxley
1
+ Relative lengths of paths and cycles in 3-connected graphs 1981 J. A. Bondy
Stephen C. Locke
1
+ PDF Chat A logical expansion in mathematics 1932 Hassler Whitney
1
+ Capturing matroid elements in unavoidable 3-connected minors 2012 Deborah Chun
James Oxley
Geoff Whittle
1
+ Graphs determined by polynomial invariants 2003 Marc Noy
1
+ On Crapo's Beta Invariant for Matroids 1982 James Oxley
1
+ The circumference of a graph with no <mml:math xmlns:mml="http://www.w3.org/1998/Math/MathML" altimg="si1.gif" overflow="scroll"><mml:msub><mml:mi>K</mml:mi><mml:mrow><mml:mn>3</mml:mn><mml:mo>,</mml:mo><mml:mi>t</mml:mi></mml:mrow></mml:msub></mml:math>-minor 2006 Guantao Chen
Laura Sheppardson
Xingxing Yu
Wenan Zang
1
+ On chromatic equivalence of graphs 1978 Chong-Yun Chao
Earl Glen Whitehead
1
+ Applications of the Strong Splitter Theorem: decomposition results 2014 S. R. Kingan
1
+ The Möbius Function and the Characteristic Polynomial 1987 Thomas ZasÄșavsky
1
+ PDF Chat On Connectivity in Matroids and Graphs 1981 James Oxley
1
+ Gallai’s question and constructions of almost hypotraceable graphs 2018 Gábor Wiener
Carol T. Zamfirescu
1
+ Intersection of longest paths in graph classes 2019 MĂĄrcia R. Cerioli
Paloma T. Lima
1
+ Nonempty Intersection of Longest Paths in $2K_2$-Free Graphs 2018 Gili Golan
Songling Shan
1
+ The circumference of a graph with no <mml:math xmlns:mml="http://www.w3.org/1998/Math/MathML" altimg="si1.gif" overflow="scroll"><mml:msub><mml:mrow><mml:mi>K</mml:mi></mml:mrow><mml:mrow><mml:mn>3</mml:mn><mml:mo>,</mml:mo><mml:mi>t</mml:mi></mml:mrow></mml:msub></mml:math>-minor, II 2012 Guantao Chen
Xingxing Yu
Wenan Zang
1
+ Detour trees 2016 Adam S. Jobson
André E. Kézdy
Jenö Lehel
Susan C. White
1
+ PDF Chat Transversals of Longest Paths and Cycles 2014 Dieter Rautenbach
Jean‐SĂ©bastien Sereni
1
+ Handbook of Combinatorics 1995 Ronald Graham
Martin Grötschel
LĂĄszlĂł LovĂĄsz
1
+ PDF Chat Nonempty intersection of longest paths in series–parallel graphs 2016 Guantao Chen
Julia EhrenmĂŒller
Cristina G. Fernandes
Carl Georg Heise
Songling Shan
Ping Yang
Amy N. Yates
1
+ PDF Chat Zur allgemeinen Kurventheorie 1927 Karl Menger
1
+ PDF Chat Nonempty intersection of longest paths in a graph with a small matching number 2015 Fuyuan Chen
1
+ PDF Chat Characterizing binary matroids with no<mml:math xmlns:mml="http://www.w3.org/1998/Math/MathML" altimg="si1.gif" overflow="scroll"><mml:msub><mml:mrow><mml:mi>P</mml:mi></mml:mrow><mml:mrow><mml:mn>9</mml:mn></mml:mrow></mml:msub></mml:math>-minor 2015 Guoli Ding
Haidong Wu
1
+ On $t$-designs 1975 D. K. Ray-Chaudhuri
Richard M. Wilson
1
+ Characterizing Combinatorial Geometries by Numerical Invariants 1999 Joseph E. Bonin
William P. Miller
1
+ An Upper Bound on the Number of Edges of a 2-Connected Graph 1997 Pou-Lin Wu
1