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

• JACKSON W, OWEN JC (2018). Equivalent Realisations of a Rigid Graph. nameOfConference

  10.1016/j.dam.2017.12.009

  http://qmro.qmul.ac.uk/xmlui/handle/123456789/31438
• Jackson B, Jordán T, Tanigawa S-I (2016). Unique low rank completability of partially filled matrices. nameOfConference

  10.1016/j.jctb.2016.07.013

  http://qmro.qmul.ac.uk/xmlui/handle/123456789/15005
• Jackson B, Owen JC (2016). A characterisation of the generic rigidity of 2-dimensional point-line frameworks. nameOfConference

  10.1016/j.jctb.2015.12.007

  http://qmro.qmul.ac.uk/xmlui/handle/123456789/31961
• Bang-Jensen J, Bessy S, Jackson B et al. (2016). Antistrong digraphs. nameOfConference

  10.1016/j.jctb.2016.05.004

  http://qmro.qmul.ac.uk/xmlui/handle/123456789/13601
• Jackson B, Nixon A (2015). Stress Matrices and Global Rigidity of Frameworks on Surfaces. nameOfConference

  10.1007/s00454-015-9724-8

  qmroHref
• JACKSON B (2015). Chromatic polynomials. nameOfConference

  doi

  qmroHref
• Jackson B, Nguyen VH (2015). Graded sparse graphs and body-length-direction frameworks. nameOfConference

  10.1016/j.ejc.2014.10.010

  qmroHref
• Jackson B, McCourt TA, Nixon A (2014). Necessary Conditions for the Generic Global Rigidity of Frameworks on Surfaces. nameOfConference

  10.1007/s00454-014-9616-3

  qmroHref
• JACKSON B, Jordan T, Szabadka Z (2014). Globally linked pairs of vertices in rigid framework. nameOfConference

  doi

  qmroHref
• Jackson B, Jordan T, Tanigawa S-I (2014). COMBINATORIAL CONDITIONS FOR THE UNIQUE COMPLETABILITY OF LOW-RANK MATRICES. nameOfConference

  10.1137/140960098

  http://qmro.qmul.ac.uk/xmlui/handle/123456789/6656
• Jackson B (2013). Counting 2-connected deletion-minors of binary matroids. nameOfConference

  10.1016/j.disc.2012.11.003

  qmroHref
• Jackson B, Jordan T, Kiraly C (2013). Strongly rigid tensegrity graphs on the line. nameOfConference

  10.1016/j.dam.2012.12.009

  qmroHref
• 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. nameOfConference

  10.1016/j.jctb.2012.08.002

  qmroHref
• Jackson B, Keevash P (2011). Bounded Direction-Length Frameworks. nameOfConference

  10.1007/s00454-011-9325-0

  qmroHref
• 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. nameOfConference

  10.1016/j.jctb.2011.02.009

  qmroHref
• Jackson B, Keevash P (2011). Necessary Conditions for the Global Rigidity of Direction-Length Frameworks. nameOfConference

  10.1007/s00454-011-9326-z

  qmroHref
• Dong FM, Jackson B (2011). A ZERO-FREE INTERVAL FOR CHROMATIC POLYNOMIALS OF NEARLY 3-CONNECTED PLANE GRAPHS. nameOfConference

  10.1137/100790057

  qmroHref
• Jackson B, Jordan T (2010). OPERATIONS PRESERVING GLOBAL RIGIDITY OF GENERIC DIRECTION-LENGTH FRAMEWORKS. nameOfConference

  10.1142/S0218195910003487

  qmroHref
• Jackson B, Sokal AD (2010). Maxmaxflow and Counting Subgraphs. nameOfConference

  doi

  qmroHref
• Kiraly Z, Cosh B, Jackson B (2010). Local edge-connectivity augmentation in hypergraphs is NP-complete. nameOfConference

  10.1016/j.dam.2009.12.011

  qmroHref
• Jackson B, Jordan T (2010). The generic rank of body-bar-and-hinge frameworks. nameOfConference

  10.1016/j.ejc.2009.03.030

  qmroHref
• Jackson B, Jordan T (2010). Brick partitions of graphs. nameOfConference

  10.1016/j.disc.2008.09.034

  qmroHref
• Jackson B (2010). AN INEQUALITY FOR TUTTE POLYNOMIALS. nameOfConference

  10.1007/s00493-010-2484-4

  qmroHref
• Jackson B, Jordan T (2010). Globally rigid circuits of the direction-length rigidity matroid. nameOfConference

  10.1016/j.jctb.2009.03.004

  qmroHref
• Jackson B, Sokal AD (2009). Zero-free regions for multivariate Tutte polynomials (alias Potts-model partition functions) of graphs and matroids. nameOfConference

  10.1016/j.jctb.2009.03.002

  qmroHref
• Jackson B, Yoshimoto K (2009). Spanning Even Subgraphs of 3-Edge-Connected Graphs. nameOfConference

  10.1002/jgt.20386

  qmroHref
• JACKSON B, Jordan T (2009). Graph theoretical techniques in the analysis of uniquely localizable sensor network. nameOfConference

  doi

  qmroHref
• Jackson B, Jordan T (2009). A sufficient connectivity condition for generic rigidity in the plane. nameOfConference

  10.1016/j.dam.2008.12.003

  qmroHref
• Abreu M, Aldred REL, Funk M et al. (2009). Graphs and digraphs with all 2-factors isomorphic (vol 92, pg 395, 2004). nameOfConference

  10.1016/j.jctb.2008.09.001

  qmroHref
• Jackson B, Jordan T (2008). Pin-collinear body-and-pin frameworks and the molecular conjecture. nameOfConference

  10.1007/s00454-008-9100-z

  qmroHref
• Cameron PJ, Jackson B, Rudd JD (2008). Orbit-counting polynomials for graphs and codes. nameOfConference

  10.1016/j.disc.2007.07.108

  qmroHref
• Abreu M, Diwan AA, Jackson B et al. (2008). Pseudo 2-factor isomorphic regular bipartite graphs. nameOfConference

  10.1016/j.jctb.2007.08.006

  qmroHref
• Jackson B, Jordan T (2008). ON THE RIGIDITY OF MOLECULAR GRAPHS. nameOfConference

  10.1007/s00493-008-2287-z

  qmroHref
• Fleischner H, Genest F, Jackson B (2007). Compatible circuit decompositions of 4-regular graphs. nameOfConference

  10.1002/jgt.20262

  qmroHref
• Jackson B, Yoshimoto K (2007). Even subgraphs of bridgeless graphs and 2-factors of line graphs. nameOfConference

  10.1016/j.disc.2006.11.023

  qmroHref
• Jackson B, Jordan T (2007). Rigid components in molecular graphs. nameOfConference

  10.1007/s00453-007-0170-8

  qmroHref
• Aldred REL, Jackson B (2007). Edge proximity conditions for extendability in cubic bipartite graphs. nameOfConference

  10.1002/jgt.20226

  qmroHref
• Jackson B, Sethuraman G, Whitehead C (2007). A note on the Erdos-Farber-Lovasz conjecture. nameOfConference

  10.1016/j.disc.2005.11.053

  qmroHref
• Jackson B, Servatius B, Servatius H (2007). The 2-dimensional rigidity of certain families of graphs. nameOfConference

  10.1002/jgt.20196

  qmroHref
• Jackson B (2007). A zero-free interval for flow polynomials of cubic graphs. nameOfConference

  10.1016/j.jctb.2006.04.006

  qmroHref
• Jackson B (2007). Zero-free intervals for flow polynomials of near-cubic graphs. nameOfConference

  10.1017/S0963548306007747

  qmroHref
• Jackson B, Jordan T (2006). On the rank function of the 3-dimensional rigidity matroid. nameOfConference

  10.1142/S0218195906002117

  qmroHref
• Jackson B, Jordan T, Szabadka Z (2006). Globally linked pairs of vertices in equivalent realizations of graphs. nameOfConference

  10.1007/s00454-005-1225-8

  qmroHref
• Jackson B, Jordan T (2005). Rigid two-dimensional frameworks with three collinear points. nameOfConference

  10.1007/s00373-005-0629-9

  qmroHref
• Jackson B, Jordan T (2005). The Dress conjectures on rank in the 3-dimensional rigidity matroid. nameOfConference

  10.1016/j.aam.2005.03.004

  qmroHref
• Jackson B, Jordan T (2005). The d-dimensional rigidity matroid of sparse graphs. nameOfConference

  10.1016/j.jctb.2005.03.004

  qmroHref
• Jackson B, Jordan T (2005). Connected rigidity matroids and unique realizations of graphs. nameOfConference

  10.1016/j.jctb.2004.11.002

  http://qmro.qmul.ac.uk/xmlui/handle/123456789/13850
• Jackson B, Jordan T (2005). Independence free graphs and vertex connectivity augmentation. nameOfConference

  10.1016/j.jctb.2004.01.004

  qmroHref
• Abreu M, Aldred REL, Funk M et al. (2004). Graphs and digraphs with all 2-factors isomorphic. nameOfConference

  10.1016/j.jctb.2004.09.004

  qmroHref
• Aldred REL, Funk M, Jackson B et al. (2004). Regular bipartite graphs with all 2-factors isomorphic. nameOfConference

  10.1016/j.jctb.2004.05.002

  qmroHref
• Berg AR, Jackson B, Jordan T (2003). Edge splitting and connectivity augmentation in directed hypergraphs. nameOfConference

  10.1016/S0012-365X(03)00229-2

  qmroHref
• Funk M, Jackson B, Labbate D et al. (2003). Det-extremal cubic bipartite graphs. nameOfConference

  10.1002/jgt.10131

  qmroHref
• Berg AR, Jackson B, Jordan T (2003). Highly edge-connected detachments of graphs and digraphs. nameOfConference

  10.1002/jgt.10104

  qmroHref
• Funk M, Jackson B, Labbate D et al. (2003). 2-Factor hamiltonian graphs. nameOfConference

  10.1016/S0095-8956(02)00031-X

  qmroHref
• Jackson B, Jordan T (2003). Non-separable detachments of graphs. nameOfConference

  10.1016/S0095-8956(02)00026-6

  qmroHref
• JACKSON WB (2003). Zeros of chromatic and flow polynomials of graphs. nameOfConference

  10.1007/s00022-003-1694-y

  qmroHref
• Jackson B, Yu XX (2002). Hamilton cycles in plane triangulations. nameOfConference

  10.1002/jgt.10057

  qmroHref
• JACKSON B, Jordan T (2001). Independence free graphs and vertex-connectivity augmentation. IPCO 2001

  doi

  qmroHref
• Jackson B, Jordan T (2000). A near optimal algorithm for vertex connectivity augmentation. ISAAC 2000

  doi

  qmroHref
• Goddyn LA, Jackson B (1999). Removable circuits in binary matroids. nameOfConference

  10.1017/S0963548399003934

  qmroHref
• van den Heuvel J, Jackson B (1999). On the edge connectivity, hamiltonicity, and toughness of vertex-transitive graphs. nameOfConference

  10.1006/jctb.1999.1917

  qmroHref
• Bang-Jensen J, Jackson B (1999). Augmenting hypergraphs by edges of size two. nameOfConference

  10.1007/s101070050033

  qmroHref
• Jackson B, Whitehead CA (1999). Some remarks on Jaeger's dual-Hamltonian conjecture. nameOfConference

  10.5802/aif.1699

  qmroHref
• Bondy JA, Jackson B (1998). Vertices of small degree in uniquely Hamiltonian graphs. nameOfConference

  10.1006/jctb.1998.1845

  qmroHref
• Hochstattler W, Jackson B (1998). Large circuits in binary matroids of large cogirth, I. nameOfConference

  10.1006/jctb.1998.1833

  qmroHref
• Hochstattler W, Jackson B (1998). Large circuits in binary matroids of large cogirth, II. nameOfConference

  10.1006/jctb.1998.1840

  qmroHref
• Edwards H, Hierons R, Jackson B (1998). The zero-free intervals for characteristic polynomials of matroids. nameOfConference

  10.1017/S0963548398003381

  qmroHref
• Jackson B, Sheehan J (1997). The structure of transform graphs. nameOfConference

  10.1016/S0012-365X(96)00360-3

  qmroHref
• Jackson B, Wormald NC (1996). On the linear k-arboricity of cubic graphs. nameOfConference

  10.1016/0012-365X(95)00293-6

  qmroHref
• Broersma HJ, vandenHeuvel J, Jackson B et al. (1996). Hamiltonicity of regular 2-connected graphs. nameOfConference

  10.1002/(SICI)1097-0118(199606)22:2<105::AID-JGT2>3.0.CO;2-R

  qmroHref
• Andersen LD, Bouchet A, Jackson B (1996). Orthogonal A-trails of 4-regular graphs embedded in surfaces of low genus. nameOfConference

  10.1006/jctb.1996.0017

  qmroHref
• BANGJENSEN J, FRANK A, JACKSON B (1995). PRESERVING AND INCREASING LOCAL EDGE-CONNECTIVITY IN MIXED GRAPHS. nameOfConference

  10.1137/S0036142993226983

  qmroHref
• JACKSON B (1995). CYCLES THROUGH VERTICES OF LARGE MAXIMUM DEGREE. nameOfConference

  10.1002/jgt.3190190204

  qmroHref
• JACKSON B, WORMALD NC (1995). LONG CYCLES AND 3-CONNECTED SPANNING SUBGRAPHS OF BOUNDED DEGREE IN 3-CONNECTED K-1,D-FREE GRAPHS. nameOfConference

  10.1006/jctb.1995.1013

  qmroHref
• JACKSON B, KATERINIS P (1994). A CHARACTERIZATION OF 3/2-TOUGH CUBIC GRAPHS. nameOfConference

  doi

  qmroHref
• JACKSON B, LI H (1994). HAMILTON CYCLES IN 2-CONNECTED REGULAR BIPARTITE GRAPHS. nameOfConference

  10.1006/jctb.1994.1067

  qmroHref
• JACKSON B (1994). SHORTEST CIRCUIT COVERS OF CUBIC GRAPHS. nameOfConference

  10.1006/jctb.1994.1021

  qmroHref
• JACKSON B (1993). HAMILTON CYCLES IN ALMOST-REGULAR 2-CONNECTED GRAPHS. nameOfConference

  10.1006/jctb.1993.1007

  qmroHref
• JACKSON B (1993). On circuit covers, circuit decompositions and Euler tours of graphs. nameOfConference

  doi

  qmroHref
• JACKSON B, Wormald NC (1992). Longest cycles in 3-connected graphs of bounded max- imum degree. nameOfConference

  doi

  qmroHref
• JACKSON B, LI H, ZHU YJ (1992). DOMINATING CYCLES IN REGULAR 3-CONNECTED GRAPHS. nameOfConference

  10.1016/0012-365X(92)90051-G

  qmroHref
• JACKSON B, WORMALD NC (1992). LONGEST CYCLES IN 3-CONNECTED PLANAR GRAPHS. nameOfConference

  10.1016/0095-8956(92)90058-6

  qmroHref
• JACKSON B (1991). A CHARACTERIZATION OF GRAPHS HAVING 3 PAIRWISE COMPATIBLE EULER TOURS. nameOfConference

  10.1016/0095-8956(91)90054-N

  qmroHref
• JACKSON B (1991). NEIGHBORHOOD UNIONS AND HAMILTON CYCLES. nameOfConference

  10.1002/jgt.3190150409

  qmroHref
• JACKSON B (1991). SUPPLEMENTARY EULERIAN VECTORS IN ISOTROPIC SYSTEMS. nameOfConference

  10.1016/0095-8956(91)90055-O

  qmroHref
• ALDRED REL, JACKSON B, LOU DJ et al. (1991). PARTITIONING REGULAR GRAPHS INTO EQUICARDINAL LINEAR FORESTS. nameOfConference

  10.1016/0012-365X(91)90054-6

  qmroHref
• ALDRED REL, HOLTON DA, JACKSON B (1991). UNIFORM CYCLIC EDGE CONNECTIVITY IN CUBIC GRAPHS. nameOfConference

  10.1007/BF01206354

  qmroHref
• JACKSON B, ORDAZ O (1990). CHVATAL-ERDOS CONDITIONS FOR PATHS AND CYCLES IN GRAPHS AND DIGRAPHS - A SURVEY. nameOfConference

  10.1016/0012-365X(90)90130-A

  qmroHref
• HOLTON DA, JACKSON B, SAITO A et al. (1990). REMOVABLE EDGES IN 3-CONNECTED GRAPHS. nameOfConference

  10.1002/jgt.3190140410

  qmroHref
• JACKSON B (1990). SHORTEST CIRCUIT COVERS AND POSTMAN TOURS IN GRAPHS WITH A NOWHERE ZERO 4-FLOW. nameOfConference

  10.1137/0219044

  qmroHref
• HAHN G, JACKSON B (1990). A NOTE CONCERNING PATHS AND INDEPENDENCE NUMBER IN DIGRAPHS. nameOfConference

  10.1016/0012-365X(90)90210-9

  qmroHref
• JACKSON B, WORMALD NC (1990). CYCLES CONTAINING MATCHINGS AND PAIRWISE COMPATIBLE EULER TOURS. nameOfConference

  10.1002/jgt.3190140114

  qmroHref
• FLEISCHNER H, HILTON AJW, JACKSON B (1990). ON THE MAXIMUM NUMBER OF PAIRWISE COMPATIBLE EULER CYCLES. nameOfConference

  10.1002/jgt.3190140106

  qmroHref
• JACKSON B (1990). Compatible Euler tours in Eulerian digraphs. nameOfConference

  doi

  qmroHref
• JACKSON B, Wormald NC (1990). K-walks. nameOfConference

  doi

  qmroHref
• JACKSON B, WHITTY RW (1989). A NOTE CONCERNING GRAPHS WITH UNIQUE F-FACTORS. nameOfConference

  10.1002/jgt.3190130507

  qmroHref
• FRIEZE AM, JACKSON B, MCDIARMID CJH et al. (1988). EDGE-COLOURING RANDOM GRAPHS. nameOfConference

  10.1016/0095-8956(88)90065-2

  qmroHref
• JACKSON B, ORDAZ O (1988). CHVATAL-ERDOS CONDITIONS FOR 2-CYCLABILITY IN DIGRAPHS. nameOfConference

  doi

  qmroHref
• ANDERSEN LD, FLEISCHNER H, JACKSON B (1988). REMOVABLE EDGES IN CYCLICALLY 4-EDGE-CONNECTED CUBIC GRAPHS. nameOfConference

  10.1007/BF01864149

  qmroHref
• JACKSON B (1987). A CHVATAL-ERDOS CONDITION FOR HAMILTON CYCLES IN DIGRAPHS. nameOfConference

  10.1016/0095-8956(87)90001-3

  qmroHref
• JACKSON B (1987). COMPATIBLE EULER TOURS FOR TRANSITION-SYSTEMS IN EULERIAN GRAPHS. nameOfConference

  10.1016/0012-365X(87)90125-7

  qmroHref
• FRIEZE AM, JACKSON B (1987). LARGE INDUCED TREES IN SPARSE RANDOM GRAPHS. nameOfConference

  10.1016/0095-8956(87)90039-6

  qmroHref
• FLEISCHNER H, JACKSON B (1987). COMPATIBLE PATH-CYCLE-DECOMPOSITIONS OF PLANE GRAPHS. nameOfConference

  10.1016/0095-8956(87)90066-9

  qmroHref
• FRIEZE AM, JACKSON B (1987). LARGE HOLES IN SPARSE RANDOM GRAPHS. nameOfConference

  10.1007/BF02579303

  qmroHref
• JACKSON B (1986). LONGEST CYCLES IN 3-CONNECTED CUBIC GRAPHS. nameOfConference

  10.1016/0095-8956(86)90024-9

  qmroHref
• FLEISCHNER H, JACKSON B (1985). REMOVABLE CYCLES IN PLANAR GRAPHS. nameOfConference

  10.1112/jlms/s2-31.2.193

  qmroHref
• JACKSON B, ORDAZ O (1985). A CHVATAL-ERDOS CONDITION FOR (1,1)-FACTORS IN DIGRAPHS. nameOfConference

  10.1016/0012-365X(85)90169-4

  qmroHref
• JACKSON B (1985). LONG CYCLES IN BIPARTITE GRAPHS. nameOfConference

  10.1016/0095-8956(85)90077-2

  qmroHref
• BERMOND JC, JACKSON B, JAEGER F (1983). SHORTEST COVERINGS OF GRAPHS WITH CYCLES. nameOfConference

  10.1016/0095-8956(83)90056-4

  qmroHref
• JACKSON B (1981). CYCLES IN BIPARTITE GRAPHS. nameOfConference

  10.1016/0095-8956(81)90050-2

  qmroHref
• JACKSON B (1980). HAMILTON CYCLES IN REGULAR 2-CONNECTED GRAPHS. nameOfConference

  10.1016/0095-8956(80)90042-8

  qmroHref
• JACKSON B (1979). EDGE-DISJOINT HAMILTON CYCLES IN REGULAR GRAPHS OF LARGE DEGREE. nameOfConference

  10.1112/jlms/s2-19.1.13

  qmroHref