Professor Bill Jackson
Professor of Mathematical Sciences
Email: b.jackson@qmul.ac.ukTelephone: +44 (0)20 7882 5476Room Number: Mathematical Sciences Building, Room: MB-515Website: http://www.maths.qmul.ac.uk/~billOffice Hours: Please email to make an appointment
Profile
Bill Jackson received his PhD from the University of Waterloo in Canada in 1978 and then returned to England as a postdoctoral research fellow at the University of Reading. He has lectured at the University of London since 1980 and is currently head of the Combinatorics Research Group at Queen Mary. He has served on the British Combinatorial Committee and the editorial board of the Journal of Combinatorial Theory, Series B. He is a member of the Egerváry Research Group on Combinatorial Optimisation at Eötvös University in Budapest. His research interests are in Graph Theory, Matroid Theory and Discrete Geometry.
Research
Publications
-
(2021). An improved bound for the rigidity of linearly constrained frameworks SIAM Journal on Discrete Mathematics.
-
(2020). Global rigidity of direction-length frameworks Journal of Combinatorial Theory Series B.
-
(2020). Global Rigidity of 2D Linearly Constrained Frameworks International Mathematics Research Notices.
-
(2019). Global rigidity of generic frameworks on the cylinder Journal of Combinatorial Theory Series B.
-
(2019). Radically solvable graphs Journal of Combinatorial Theory Series B.
-
(2019). Equivalent realisations of a rigid graph Discrete Applied Mathematics.
-
(2019). Point-hyperplane frameworks, slider joints, and rigidity preserving transformations Journal of Combinatorial Theory Series B.
-
(2018). Rigid Cylindrical Frameworks with Two Coincident Points Graphs and Combinatorics.
-
(2018). Rigidity of Linearly Constrained Frameworks International Mathematics Research Notices.
-
(2016). Unique low rank completability of partially filled matrices Journal of Combinatorial Theory, Series B.
-
(2016). A characterisation of the generic rigidity of 2-dimensional point-line frameworks JOURNAL OF COMBINATORIAL THEORY SERIES B.
-
(2016). Antistrong digraphs Journal of Combinatorial Theory, Series B.
-
(2015). Stress Matrices and Global Rigidity of Frameworks on Surfaces Discrete & Computational Geometry.
-
(2015). Graded sparse graphs and body-length-direction frameworks European Journal of Combinatorics.
-
(2014). Henneberg moves on mechanisms Beiträge zur Algebra und Geometrie / Contributions to Algebra and Geometry.
-
(2014). Necessary Conditions for the Generic Global Rigidity of Frameworks on Surfaces DISCRETE & COMPUTATIONAL GEOMETRY.
-
(2014). Globally linked pairs of vertices in rigid framework journal.
-
(2014). Combinatorial Conditions for the Unique Completability of Low-Rank Matrices SIAM Journal on Discrete Mathematics.
-
(2013). Counting 2-connected deletion-minors of binary matroids DISCRETE MATHEMATICS.
-
(2013). Strongly rigid tensegrity graphs on the line DISCRETE APPLIED MATHEMATICS.
-
(2013). Complex zero-free regions at large vertical bar q vertical bar for multivariate Tutte polynomials (alias Potts-model partition functions) with general complex edge weights JOURNAL OF COMBINATORIAL THEORY SERIES B.
-
(2011). Boundedness, rigidity and global rigidity of direction–length frameworks Journal of Geometry.
-
(2011). Bounded Direction-Length Frameworks DISCRETE COMPUT GEOM.
-
(2011). Circumference of 3-connected claw-free graphs and large Eulerian subgraphs of 3-edge-connected graphs J COMB THEORY B.
-
(2011). Necessary Conditions for the Global Rigidity of Direction-Length Frameworks DISCRETE COMPUT GEOM.
-
(2011). A ZERO-FREE INTERVAL FOR CHROMATIC POLYNOMIALS OF NEARLY 3-CONNECTED PLANE GRAPHS SIAM J DISCRETE MATH.
-
(2010). OPERATIONS PRESERVING GLOBAL RIGIDITY OF GENERIC DIRECTION-LENGTH FRAMEWORKS INT J COMPUT GEOM AP.
-
(2010). Local edge-connectivity augmentation in hypergraphs is NP-complete DISCRETE APPL MATH.
-
(2010). The generic rank of body-bar-and-hinge frameworks EUR J COMBIN.
-
(2010). Globally rigid circuits of the direction-length rigidity matroid J COMB THEORY B.
-
(2009). Zero-free regions for multivariate Tutte polynomials (alias Potts-model partition functions) of graphs and matroids J COMB THEORY B.
-
(2009). Spanning Even Subgraphs of 3-Edge-Connected Graphs J GRAPH THEOR.
-
(2009). A sufficient connectivity condition for generic rigidity in the plane DISCRETE APPL MATH.
-
(2009). Graphs and digraphs with all 2-factors isomorphic (vol 92, pg 395, 2004) J COMB THEORY B.
-
(2008). Pin-collinear body-and-pin frameworks and the molecular conjecture DISCRETE COMPUT GEOM.
-
(2008). Orbit-counting polynomials for graphs and codes DISCRETE MATHEMATICS.
-
(2008). Pseudo 2-factor isomorphic regular bipartite graphs J COMB THEORY B.
-
(2007). Compatible circuit decompositions of 4-regular graphs J GRAPH THEOR.
-
(2007). Even subgraphs of bridgeless graphs and 2-factors of line graphs DISCRETE MATH.
-
(2007). Edge proximity conditions for extendability in cubic bipartite graphs J GRAPH THEOR.
-
(2007). A note on the Erdos-Farber-Lovasz conjecture DISCRETE MATHEMATICS.
-
(2007). The 2-dimensional rigidity of certain families of graphs J GRAPH THEOR.
-
(2007). A zero-free interval for flow polynomials of cubic graphs J COMB THEORY B.
-
(2007). Zero-free intervals for flow polynomials of near-cubic graphs COMB PROBAB COMPUT.
-
(2006). On the rank function of the 3-dimensional rigidity matroid INT J COMPUT GEOM AP.
-
(2006). Globally linked pairs of vertices in equivalent realizations of graphs DISCRETE COMPUT GEOM.
-
(2005). Rigid two-dimensional frameworks with three collinear points GRAPH COMBINATOR.
-
(2005). The Dress conjectures on rank in the 3-dimensional rigidity matroid ADV APPL MATH.
-
(2005). The d-dimensional rigidity matroid of sparse graphs J COMB THEORY B.
-
(2005). Connected rigidity matroids and unique realizations of graphs J COMB THEORY B.
-
(2005). Independence free graphs and vertex connectivity augmentation J COMB THEORY B.
-
(2004). Graphs and digraphs with all 2-factors isomorphic J COMB THEORY B.
-
(2004). Regular bipartite graphs with all 2-factors isomorphic J COMB THEORY B.
-
(2003). Edge splitting and connectivity augmentation in directed hypergraphs DISCRETE MATHEMATICS.
-
(2003). Highly edge-connected detachments of graphs and digraphs J GRAPH THEOR.
-
(2003). Zeros of chromatic and flow polynomials of graphs J. Geometry.
-
(2001). Independence free graphs and vertex-connectivity augmentation Springer Lecture Notes in Computer Science.
-
(2000). Connectivity Augmentation of Graphs Electronic Notes in Discrete Mathematics.
-
(2000). A near optimal algorithm for vertex connectivity augmentation Lecture Notes in Computer Science.
-
(1999). Removable Circuits in Binary Matroids Combinatorics Probability Computing.
-
(1999). On the Edge Connectivity, Hamiltonicity, and Toughness of Vertex-Transitive Graphs Journal of Combinatorial Theory Series B.
-
(1999). Augmenting hypergraphs by edges of size two Mathematical Programming.
-
(1999). INTEGER FLOWS AND CYCLE COVERS OF GRAPHS (Pure and Applied Mathematics 205) Bulletin of the London Mathematical Society.
-
(1999). Some remarks on Jaeger's dual-hamiltonian conjecture Annales de l’institut Fourier.
-
(1998). Vertices of Small Degree in Uniquely Hamiltonian Graphs Journal of Combinatorial Theory Series B.
-
(1998). Large Circuits in Binary Matroids of Large Cogirth, I Journal of Combinatorial Theory Series B.
-
(1998). Large Circuits in Binary Matroids of Large Cogirth, II Journal of Combinatorial Theory Series B.
-
(1998). The Zero-Free Intervals for Characteristic Polynomials of Matroids Combinatorics Probability Computing.
-
(1997). The structure of transform graphs Discrete Mathematics.
-
(1996). On the linear k-arboricity of cubic graphs Discrete Mathematics.
-
(1996). Hamiltonicity of regular 2‐connected graphs Journal of Graph Theory.
-
(1996). Orthogonal A-Trails of 4-Regular Graphs Embedded in Surfaces of Low Genus Journal of Combinatorial Theory Series B.
-
(1995). Preserving and Increasing Local Edge-Connectivity in Mixed Graphs SIAM Journal on Discrete Mathematics.
-
(1995). Cycles through vertices of large maximum degree Journal of Graph Theory.
-
(1995). Long Cycles and 3-Connected Spanning Subgraphs of Bounded Degree in 3-Connected K1, d-Free Graphs Journal of Combinatorial Theory Series B.
-
(1994). Hamilton Cycles in 2-Connected Regular Bipartite Graphs Journal of Combinatorial Theory Series B.
-
(1994). Shortest Circuit Covers of Cubic Graphs Journal of Combinatorial Theory Series B.
-
(1993). A Zero-Free Interval for Chromatic Polynomials of Graphs Combinatorics Probability Computing.
-
(1993). Hamilton Cycles in Almost-Regular 2-Connected Graphs Journal of Combinatorial Theory Series B.
-
(1992). Dominating cycles in regular 3-connected graphs Discrete Mathematics.
-
(1992). Longest cycles in 3-connected planar graphs Journal of Combinatorial Theory Series B.
-
(1991). A characterisation of graphs having three pairwise compatible Euler tours Journal of Combinatorial Theory Series B.
-
(1991). Neighborhood unions and hamilton cycles Journal of Graph Theory.
-
(1991). Supplementary Eulerian vectors in isotropic systems Journal of Combinatorial Theory Series B.
-
(1991). Partitioning regular graphs into equicardinal linear forests Discrete Mathematics.
-
(1990). Chvátal-Erdős conditions for paths and cycles in graphs and digraphs. A survey Discrete Mathematics.
-
(1990). Removable edges in 3‐connected graphs Journal of Graph Theory.
-
(1990). Shortest Circuit Covers and Postman Tours in Graphs with a Nowhere Zero 4 SIAM Journal on Computing.
-
(1990). A note concerning paths and independence number in digraphs Discrete Mathematics.
-
(1990). Cycles containing matchings and pairwise compatible euler tours Journal of Graph Theory.
-
(1990). On the maximum number of pairwise compatible euler cycles Journal of Graph Theory.
-
(1989). A note concerning graphs with unique f‐factors Journal of Graph Theory.
-
(1988). Removable edges in cyclically 4-edge-connected cubic graphs Graphs and Combinatorics.
-
(1988). Edge-colouring random graphs Journal of Combinatorial Theory Series B.
-
(1988). A Note Concerning some Conjectures on Cyclically 4–Edge Connected 3–Regular Graphs journal.
-
(1988). Some remarks on Arc‐connectivity, vertex splitting, and orientation in graphs and digraphs Journal of Graph Theory.
-
(1987). A Chvátal-Erdös condition for hamilton cycles in digraphs Journal of Combinatorial Theory Series B.
-
(1987). Compatible Euler tours for transition systems in Eulerian graphs Discrete Mathematics.
-
(1987). Large induced trees in sparse random graphs Journal of Combinatorial Theory Series B.
-
(1987). Compatible path-cycle-decompositions of plane graphs Journal of Combinatorial Theory Series B.
-
(1987). A note concerning the chromatic index of multigraphs Journal of Graph Theory.
-
(1986). Longest cycles in 3-connected cubic graphs Journal of Combinatorial Theory Series B.
-
(1985). A Chvátal-Erdös condition for (1,1)-factors in digraphs Discrete Mathematics.
-
(1985). Long cycles in bipartite graphs Journal of Combinatorial Theory Series B.
-
(1985). Removable Cycles in Planar Graphs Journal of the London Mathematical Society.
-
(1985). A Note on Maximal Cycles in 2-Connected Graphs journal.
-
(1985). Long Paths Between Specified Vertices of a Block journal.
-
(1985). Toughness and the existence of k‐factors Journal of Graph Theory.
-
(1983). Shortest coverings of graphs with cycles Journal of Combinatorial Theory Series B.
-
(1981). Cycles in bipartite graphs Journal of Combinatorial Theory Series B.
-
(1981). Long paths and cycles in oriented graphs Journal of Graph Theory.
-
(1980). Hamilton cycles in regular 2-connected graphs Journal of Combinatorial Theory Series B.
-
(1979). Edge‐Disjoint Hamilton Cycles in Regular Graphs of Large Degree Journal of the London Mathematical Society.