Skip to main content
School of Mathematical Sciences

Professor Bill Jackson

Bill

Professor of Mathematical Sciences

Email: b.jackson@qmul.ac.uk
Telephone: +44 (0)20 7882 5476
Room Number: Mathematical Sciences Building, Room: MB-515
Website: http://www.maths.qmul.ac.uk/~bill
Office 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 Professor of Mathematical Sciences 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

    • Guler H, Jackson B (2022), Coincident Rigidity of 2-Dimensional Frameworks Graphs and Combinatorics $nameOfConference
    • Clinch K, Jackson B, Tanigawa S-I (2022), Abstract 3-Rigidity and Bivariate C-2(1)-Splines I: Whiteley's Maximality Conjecture DISCRETE ANALYSIS $nameOfConference
    • Grasegger G, Guler H, Jackson B et al. (2021), Flexible circuits in the d‐dimensional rigidity matroid Journal of Graph Theory $nameOfConference
    • Guler H, Jackson B (2021), A necessary condition for generic rigidity of bar‐and‐joint frameworks in d‐space Journal of Graph Theory $nameOfConference
    • Jackson B, Nixon A, Tanigawa S-I (2021), An improved bound for the rigidity of linearly constrained frameworks SIAM Journal on Discrete Mathematics $nameOfConference
    • Clinch K, Jackson B, Tanigawa S-I (2021), Abstract 3-Rigidity and Bivariate C-2(1)-Splines II: Combinatorial Characterization DISCRETE ANALYSIS $nameOfConference
    • Clinch K, Jackson B, Keevash P (2020), Global rigidity of direction-length frameworks Journal of Combinatorial Theory Series B $nameOfConference
    • Guler H, Jackson B, Nixon A (2020), Global Rigidity of 2D Linearly Constrained Frameworks International Mathematics Research Notices $nameOfConference
    • Grasegger G, Guler H, Jackson B et al. (2020), Flexible circuits in the $d$-dimensional rigidity matroid $journal $nameOfConference
    • Jackson B, Nixon A (2019), Global rigidity of generic frameworks on the cylinder Journal of Combinatorial Theory Series B $nameOfConference
    • Jackson B, Owen JC (2019), Radically solvable graphs Journal of Combinatorial Theory Series B $nameOfConference
    • Jackson B, Owen JC (2019), Equivalent realisations of a rigid graph Discrete Applied Mathematics $nameOfConference
    • Eftekhari Y, Jackson B, Nixon A et al. (2019), Point-hyperplane frameworks, slider joints, and rigidity preserving transformations Journal of Combinatorial Theory Series B $nameOfConference
    • Jackson B, Kaszanitzky VE, Nixon A (2018), Rigid Cylindrical Frameworks with Two Coincident Points Graphs and Combinatorics $nameOfConference
    • Cruickshank J, Guler H, Jackson B et al. (2018), Rigidity of Linearly Constrained Frameworks International Mathematics Research Notices $nameOfConference
    • Jackson B, Jordán T, Tanigawa S-I (2016), Unique low rank completability of partially filled matrices Journal of Combinatorial Theory, Series B $nameOfConference
    • Clinch K, Jackson B, Keevash P (2016), Global rigidity of 2-dimensional direction-length frameworks $journal $nameOfConference
    • Jackson B, Owen JC (2016), A characterisation of the generic rigidity of 2-dimensional point-line frameworks JOURNAL OF COMBINATORIAL THEORY SERIES B $nameOfConference
    • Bang-Jensen J, Bessy S, Jackson B et al. (2016), Antistrong digraphs Journal of Combinatorial Theory, Series B $nameOfConference
    • Jackson B, Nixon A (2015), Stress Matrices and Global Rigidity of Frameworks on Surfaces Discrete & Computational Geometry $nameOfConference
    • JACKSON B (2015), Chromatic polynomials $journal $nameOfConference
    • Jackson B, Nguyen VH (2015), Graded sparse graphs and body-length-direction frameworks European Journal of Combinatorics $nameOfConference
    • Jackson B, Jordán T, Servatius B et al. (2014), Henneberg moves on mechanisms Beiträge zur Algebra und Geometrie / Contributions to Algebra and Geometry $nameOfConference
    • Jackson B, McCourt TA, Nixon A (2014), Necessary Conditions for the Generic Global Rigidity of Frameworks on Surfaces DISCRETE & COMPUTATIONAL GEOMETRY $nameOfConference
    • JACKSON B, Jordan T, Szabadka Z (2014), Globally linked pairs of vertices in rigid framework $journal $nameOfConference
    • Jackson B, Jordán T, Tanigawa S-I (2014), Combinatorial Conditions for the Unique Completability of Low-Rank Matrices SIAM Journal on Discrete Mathematics $nameOfConference
    • Jackson B (2013), Counting 2-connected deletion-minors of binary matroids DISCRETE MATHEMATICS $nameOfConference
    • Jackson B, Jordan T, Kiraly C (2013), Strongly rigid tensegrity graphs on the line DISCRETE APPLIED MATHEMATICS $nameOfConference
    • Jackson B, Procacci A, Sokal AD (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 $nameOfConference
    • Jackson B (2011), Boundedness, rigidity and global rigidity of direction–length frameworks Journal of Geometry $nameOfConference
    • Jackson B, Keevash P (2011), Bounded Direction-Length Frameworks DISCRETE COMPUT GEOM $nameOfConference
    • Bilinski M, Jackson B, Ma J et al. (2011), Circumference of 3-connected claw-free graphs and large Eulerian subgraphs of 3-edge-connected graphs J COMB THEORY B $nameOfConference
    • Jackson B, Keevash P (2011), Necessary Conditions for the Global Rigidity of Direction-Length Frameworks DISCRETE COMPUT GEOM $nameOfConference
    • Dong FM, Jackson B (2011), A ZERO-FREE INTERVAL FOR CHROMATIC POLYNOMIALS OF NEARLY 3-CONNECTED PLANE GRAPHS SIAM J DISCRETE MATH $nameOfConference
    • Jackson B, Jordan T (2010), OPERATIONS PRESERVING GLOBAL RIGIDITY OF GENERIC DIRECTION-LENGTH FRAMEWORKS INT J COMPUT GEOM AP $nameOfConference
    • Jackson B, Sokal AD (2010), Maxmaxflow and Counting Subgraphs ELECTRON J COMB $nameOfConference
    • Kiraly Z, Cosh B, Jackson B (2010), Local edge-connectivity augmentation in hypergraphs is NP-complete DISCRETE APPL MATH $nameOfConference
    • Jackson B, Jordan T (2010), The generic rank of body-bar-and-hinge frameworks EUR J COMBIN $nameOfConference
    • Jackson B, Jordan T (2010), Brick partitions of graphs DISCRETE MATHEMATICS $nameOfConference
    • Jackson B (2010), AN INEQUALITY FOR TUTTE POLYNOMIALS COMBINATORICA $nameOfConference
    • Jackson B, Jordan T (2010), Globally rigid circuits of the direction-length rigidity matroid J COMB THEORY B $nameOfConference
    • Jackson B, Sokal AD (2009), Zero-free regions for multivariate Tutte polynomials (alias Potts-model partition functions) of graphs and matroids J COMB THEORY B $nameOfConference
    • Jackson B, Yoshimoto K (2009), Spanning Even Subgraphs of 3-Edge-Connected Graphs J GRAPH THEOR $nameOfConference
    • JACKSON B, Jordan T (2009), Graph theoretical techniques in the analysis of uniquely localizable sensor network $journal $nameOfConference
    • Jackson B, Jordan T (2009), A sufficient connectivity condition for generic rigidity in the plane DISCRETE APPL MATH $nameOfConference
    • Abreu M, Aldred REL, Funk M et al. (2009), Graphs and digraphs with all 2-factors isomorphic (vol 92, pg 395, 2004) J COMB THEORY B $nameOfConference
    • Jackson B, Jordan T (2008), Pin-collinear body-and-pin frameworks and the molecular conjecture DISCRETE COMPUT GEOM $nameOfConference
    • Cameron PJ, Jackson B, Rudd JD (2008), Orbit-counting polynomials for graphs and codes DISCRETE MATHEMATICS $nameOfConference
    • Abreu M, Diwan AA, Jackson B et al. (2008), Pseudo 2-factor isomorphic regular bipartite graphs J COMB THEORY B $nameOfConference
    • Jackson B, Jordan T (2008), ON THE RIGIDITY OF MOLECULAR GRAPHS COMBINATORICA $nameOfConference
    • Fleischner H, Genest F, Jackson B (2007), Compatible circuit decompositions of 4-regular graphs J GRAPH THEOR $nameOfConference
    • Jackson B, Yoshimoto K (2007), Even subgraphs of bridgeless graphs and 2-factors of line graphs DISCRETE MATH $nameOfConference
    • Jackson B, Jordan T (2007), Rigid components in molecular graphs ALGORITHMICA $nameOfConference
    • Aldred REL, Jackson B (2007), Edge proximity conditions for extendability in cubic bipartite graphs J GRAPH THEOR $nameOfConference
    • Jackson B, Sethuraman G, Whitehead C (2007), A note on the Erdos-Farber-Lovasz conjecture DISCRETE MATHEMATICS $nameOfConference
    • Jackson B, Servatius B, Servatius H (2007), The 2-dimensional rigidity of certain families of graphs J GRAPH THEOR $nameOfConference
    • Jackson B (2007), A zero-free interval for flow polynomials of cubic graphs J COMB THEORY B $nameOfConference
    • Jackson B (2007), Zero-free intervals for flow polynomials of near-cubic graphs COMB PROBAB COMPUT $nameOfConference
    • Jackson B, Jordan T (2006), On the rank function of the 3-dimensional rigidity matroid INT J COMPUT GEOM AP $nameOfConference
    • Jackson B, Jordan T, Szabadka Z (2006), Globally linked pairs of vertices in equivalent realizations of graphs DISCRETE COMPUT GEOM $nameOfConference
    • Jackson B, Jordan T (2005), Rigid two-dimensional frameworks with three collinear points GRAPH COMBINATOR $nameOfConference
    • Jackson B, Jordan T (2005), The Dress conjectures on rank in the 3-dimensional rigidity matroid ADV APPL MATH $nameOfConference
    • Jackson B, Jordan T (2005), The d-dimensional rigidity matroid of sparse graphs J COMB THEORY B $nameOfConference
    • Jackson B, Jordan T (2005), Connected rigidity matroids and unique realizations of graphs J COMB THEORY B $nameOfConference
    • Jackson B, Jordan T (2005), Independence free graphs and vertex connectivity augmentation J COMB THEORY B $nameOfConference
    • Abreu M, Aldred REL, Funk M et al. (2004), Graphs and digraphs with all 2-factors isomorphic J COMB THEORY B $nameOfConference
    • Aldred REL, Funk M, Jackson B et al. (2004), Regular bipartite graphs with all 2-factors isomorphic J COMB THEORY B $nameOfConference
    • Berg AR, Jackson B, Jordan T (2003), Edge splitting and connectivity augmentation in directed hypergraphs DISCRETE MATHEMATICS $nameOfConference
    • Funk M, Jackson B, Labbate D et al. (2003), Det-extremal cubic bipartite graphs J GRAPH THEOR $nameOfConference
    • Berg AR, Jackson B, Jordan T (2003), Highly edge-connected detachments of graphs and digraphs J GRAPH THEOR $nameOfConference
    • Funk M, Jackson B, Labbate D et al. (2003), 2-Factor hamiltonian graphs J COMB THEORY B $nameOfConference
    • Jackson B, Jordan T (2003), Non-separable detachments of graphs J COMB THEORY B $nameOfConference
    • JACKSON WB (2003), Zeros of chromatic and flow polynomials of graphs J. Geometry $nameOfConference
    • Jackson B, Yu XX (2002), Hamilton cycles in plane triangulations J GRAPH THEOR $nameOfConference
    • JACKSON B, Jordan T (2001), Independence free graphs and vertex-connectivity augmentation Springer Lecture Notes in Computer Science IPCO 2001
    • Jackson B, Jordánn T (2000), Connectivity Augmentation of Graphs Electronic Notes in Discrete Mathematics $nameOfConference
    • Jackson B, Jordan T (2000), A near optimal algorithm for vertex connectivity augmentation Lecture Notes in Computer Science ISAAC 2000
    • GODDYN LA, JACKSON B (1999), Removable Circuits in Binary Matroids Combinatorics Probability Computing $nameOfConference
    • van den Heuvel J, Jackson B (1999), On the Edge Connectivity, Hamiltonicity, and Toughness of Vertex-Transitive Graphs Journal of Combinatorial Theory Series B $nameOfConference
    • Bang-Jensen J, Jackson B (1999), Augmenting hypergraphs by edges of size two Mathematical Programming $nameOfConference
    • Jackson B (1999), INTEGER FLOWS AND CYCLE COVERS OF GRAPHS (Pure and Applied Mathematics 205) Bulletin of the London Mathematical Society $nameOfConference
    • Jackson B, Whitehead CA (1999), Some remarks on Jaeger's dual-hamiltonian conjecture Annales de l’institut Fourier $nameOfConference
    • Bondy JA, Jackson B (1998), Vertices of Small Degree in Uniquely Hamiltonian Graphs Journal of Combinatorial Theory Series B $nameOfConference
    • Hochstättler W, Jackson B (1998), Large Circuits in Binary Matroids of Large Cogirth, I Journal of Combinatorial Theory Series B $nameOfConference
    • Hochstättler W, Jackson B (1998), Large Circuits in Binary Matroids of Large Cogirth, II Journal of Combinatorial Theory Series B $nameOfConference
    • EDWARDS H, HIERONS R, JACKSON B (1998), The Zero-Free Intervals for Characteristic Polynomials of Matroids Combinatorics Probability Computing $nameOfConference
    • Jackson B, Sheehan J (1997), The structure of transform graphs Discrete Mathematics $nameOfConference
    • Jackson B, Wormald NC (1996), On the linear k-arboricity of cubic graphs Discrete Mathematics $nameOfConference
    • Broersma HJ, van den Heuvel J, Jackson B et al. (1996), Hamiltonicity of regular 2‐connected graphs Journal of Graph Theory $nameOfConference
    • Andersen LD, Bouchet A, Jackson B (1996), Orthogonal A-Trails of 4-Regular Graphs Embedded in Surfaces of Low Genus Journal of Combinatorial Theory Series B $nameOfConference
    • Bang-Jensen J, Frank A, Jackson B (1995), Preserving and Increasing Local Edge-Connectivity in Mixed Graphs SIAM Journal on Discrete Mathematics $nameOfConference
    • Jackson B (1995), Cycles through vertices of large maximum degree Journal of Graph Theory $nameOfConference
    • Jackson B, Wormald NC (1995), Long Cycles and 3-Connected Spanning Subgraphs of Bounded Degree in 3-Connected K1, d-Free Graphs Journal of Combinatorial Theory Series B $nameOfConference
    • JACKSON B, KATERINIS P (1994), A CHARACTERIZATION OF 3/2-TOUGH CUBIC GRAPHS ARS COMBINATORIA $nameOfConference
    • Jackson B, Li H (1994), Hamilton Cycles in 2-Connected Regular Bipartite Graphs Journal of Combinatorial Theory Series B $nameOfConference
    • Jackson B (1994), Shortest Circuit Covers of Cubic Graphs Journal of Combinatorial Theory Series B $nameOfConference
    • Jackson B (1993), A Zero-Free Interval for Chromatic Polynomials of Graphs Combinatorics Probability Computing $nameOfConference
    • Jackson B (1993), Hamilton Cycles in Almost-Regular 2-Connected Graphs Journal of Combinatorial Theory Series B $nameOfConference
    • JACKSON B (1993), On circuit covers, circuit decompositions and Euler tours of graphs $journal $nameOfConference
    • JACKSON B, Wormald NC (1992), Longest cycles in 3-connected graphs of bounded max- imum degree $journal $nameOfConference
    • Jackson B, Li H, Zhu Y (1992), Dominating cycles in regular 3-connected graphs Discrete Mathematics $nameOfConference
    • Jackson B, Wormald NC (1992), Longest cycles in 3-connected planar graphs Journal of Combinatorial Theory Series B $nameOfConference
    • Jackson B (1991), A characterisation of graphs having three pairwise compatible Euler tours Journal of Combinatorial Theory Series B $nameOfConference
    • Jackson B (1991), Neighborhood unions and hamilton cycles Journal of Graph Theory $nameOfConference
    • Jackson B (1991), Supplementary Eulerian vectors in isotropic systems Journal of Combinatorial Theory Series B $nameOfConference
    • Aldred REL, Holton DA, Jackson B (1991), Uniform cyclic edge connectivity in cubic graphs Combinatorica $nameOfConference
    • Aldred REL, Jackson B, Lou D et al. (1991), Partitioning regular graphs into equicardinal linear forests Discrete Mathematics $nameOfConference
    • Jackson B, Ordaz O (1990), Chvátal-Erdős conditions for paths and cycles in graphs and digraphs. A survey Discrete Mathematics $nameOfConference
    • Holton DA, Jackson B, Saito A et al. (1990), Removable edges in 3‐connected graphs Journal of Graph Theory $nameOfConference
    • Jackson B (1990), Shortest Circuit Covers and Postman Tours in Graphs with a Nowhere Zero 4 SIAM Journal on Computing $nameOfConference
    • Hahn G, Jackson B (1990), A note concerning paths and independence number in digraphs Discrete Mathematics $nameOfConference
    • Jackson B, Wormald NC (1990), Cycles containing matchings and pairwise compatible euler tours Journal of Graph Theory $nameOfConference
    • Fleischner H, Hilton AJW, Jackson B (1990), On the maximum number of pairwise compatible euler cycles Journal of Graph Theory $nameOfConference
    • JACKSON B (1990), Compatible Euler tours in Eulerian digraphs $journal $nameOfConference
    • JACKSON B, Wormald NC (1990), K-walks Australasian J. of Combinatorics $nameOfConference
    • Jackson B, Whitty RW (1989), A note concerning graphs with unique f‐factors Journal of Graph Theory $nameOfConference
    • Andersen LD, Fleischner H, Jackson B (1988), Removable edges in cyclically 4-edge-connected cubic graphs Graphs and Combinatorics $nameOfConference
    • Frieze AM, Jackson B, McDiarmid CJH et al. (1988), Edge-colouring random graphs Journal of Combinatorial Theory Series B $nameOfConference
    • JACKSON B, ORDAZ O (1988), CHVATAL-ERDOS CONDITIONS FOR 2-CYCLABILITY IN DIGRAPHS ARS COMBINATORIA $nameOfConference
    • Fleischner H, Jackson B (1988), A Note Concerning some Conjectures on Cyclically 4–Edge Connected 3–Regular Graphs $journal $nameOfConference
    • Jackson B (1988), Some remarks on Arc‐connectivity, vertex splitting, and orientation in graphs and digraphs Journal of Graph Theory $nameOfConference
    • Jackson B (1987), A Chvátal-Erdös condition for hamilton cycles in digraphs Journal of Combinatorial Theory Series B $nameOfConference
    • Frieze AM, Jackson B (1987), Large holes in sparse random graphs Combinatorica $nameOfConference
    • Jackson B (1987), Compatible Euler tours for transition systems in Eulerian graphs Discrete Mathematics $nameOfConference
    • Frieze AM, Jackson B (1987), Large induced trees in sparse random graphs Journal of Combinatorial Theory Series B $nameOfConference
    • Fleischner H, Jackson B (1987), Compatible path-cycle-decompositions of plane graphs Journal of Combinatorial Theory Series B $nameOfConference
    • Hilton AJW, Jackson B (1987), A note concerning the chromatic index of multigraphs Journal of Graph Theory $nameOfConference
    • Jackson B (1986), Longest cycles in 3-connected cubic graphs Journal of Combinatorial Theory Series B $nameOfConference
    • Jackson B, Ordaz O (1985), A Chvátal-Erdös condition for (1,1)-factors in digraphs Discrete Mathematics $nameOfConference
    • Jackson B (1985), Long cycles in bipartite graphs Journal of Combinatorial Theory Series B $nameOfConference
    • Fleischner H, Jackson B (1985), Removable Cycles in Planar Graphs Journal of the London Mathematical Society $nameOfConference
    • Häggkvist R, Jackson B (1985), A Note on Maximal Cycles in 2-Connected Graphs $journal $nameOfConference
    • Bondy JA, Jackson B (1985), Long Paths Between Specified Vertices of a Block $journal $nameOfConference
    • Enomoto H, Jackson B, Katerinis P et al. (1985), Toughness and the existence of k‐factors Journal of Graph Theory $nameOfConference
    • Bermond JC, Jackson B, Jaeger F (1983), Shortest coverings of graphs with cycles Journal of Combinatorial Theory Series B $nameOfConference
    • Jackson B (1983), Maximal Cycles in Bipartite Graphs $journal $nameOfConference
    • Jackson B (1981), Cycles in bipartite graphs Journal of Combinatorial Theory Series B $nameOfConference
    • Jackson B (1981), Long paths and cycles in oriented graphs Journal of Graph Theory $nameOfConference
    • Jackson B (1980), Hamilton cycles in regular 2-connected graphs Journal of Combinatorial Theory Series B $nameOfConference
    • Jackson B (1979), Edge‐Disjoint Hamilton Cycles in Regular Graphs of Large Degree Journal of the London Mathematical Society $nameOfConference
    • Jackson B (1978), Hamilton cycles in regular graphs Journal of Graph Theory $nameOfConference
Back to top