Prof William Jackson

William Jackson

Professor of Mathematical Sciences

School of Mathematical Sciences
Queen Mary University of London

Publications

solid heart iconPublications of specific relevance to the Centre for Combinatorics, Algebra and Number Theory

2024

bullet iconJackson B and Tanigawa S-I (2024). Maximal matroids in weak order posets. Journal of Combinatorial Theory Series B, Elsevier vol. 165, 20-46.  
01-03-2024

2023

bullet iconJackson W, Aldred REL and Plummer MD (2023). Edge proximity conditions for extendability in regular bipartite graphs. Journal of Graph Theory, Wiley 
13-04-2023

2022

bullet iconGrasegger G, Guler H, Jackson B and Nixon A (2022). Corrigendum to: Flexible circuits in the d-dimensional rigidity matroid (Journal of Graph Theory, (2022), 100, 2, (315-330), 10.1002/jgt.22780). Journal of Graph Theory 
15-12-2022
bullet iconCruickshank J, Jackson B and Tanigawa SI (2022). Vertex Splitting, Coincident Realisations, and Global Rigidity of Braced Triangulations. Discrete & Computational Geometry, Springer vol. 69 (1), 192-208.  
19-11-2022
bullet iconGuler H and Jackson B (2022). Coincident Rigidity of 2-Dimensional Frameworks. Graphs and Combinatorics vol. 38 (4), 128-128.  
30-07-2022
bullet iconClinch K, Jackson B and Tanigawa SI (2022). Abstract 3-Rigidity and Bivariate C½-Splines II: Combinatorial Characterization. Discrete Analysis, Diamond Open Access Journals vol. 2022, 1-32.  
11-05-2022
bullet iconJackson B (2022). Zeros of the Tutte polynomial. Handbook of the Tutte Polynomial and Related Topics  461-472.  
11-05-2022
bullet iconClinch K, Jackson B and Tanigawa S-I (2022). Abstract 3-Rigidity and Bivariate C21-Splines I: Whiteley's Maximality Conjecture. DISCRETE ANALYSIS 
01-01-2022

2021

bullet iconGrasegger G, Guler H, Jackson B and Nixon A (2021). Flexible circuits in the d‐dimensional rigidity matroid. Journal of Graph Theory 
06-12-2021
bullet iconGuler H and Jackson B (2021). A necessary condition for generic rigidity of bar‐and‐joint frameworks in d‐space. Journal of Graph Theory, Wiley vol. 99 (2), 231-239.  
08-09-2021
bullet iconJackson B, Nixon A and Tanigawa S-I (2021). An improved bound for the rigidity of linearly constrained frameworks. SIAM Journal on Discrete Mathematics, Society for Industrial and Applied Mathematics 
04-05-2021
bullet iconClinch K, Jackson B and Tanigawa S-I (2021). Abstract 3-Rigidity and Bivariate C21-Splines II: Combinatorial Characterization. DISCRETE ANALYSIS 
01-01-2021

2020

bullet iconClinch K, Jackson B and Keevash P (2020). Global rigidity of direction-length frameworks. Journal of Combinatorial Theory Series B, Elsevier vol. 145, 145-168.  
01-11-2020
bullet iconGuler H, Jackson B and Nixon A (2020). Global Rigidity of 2D Linearly Constrained Frameworks. International Mathematics Research Notices, Oxford University Press (OUP) vol. 2021 (22), 16811-16858.  
26-10-2020

2019

bullet iconJackson B and Nixon A (2019). Global rigidity of generic frameworks on the cylinder. Journal of Combinatorial Theory Series B, Elsevier vol. 139, 193-229.  
01-11-2019
bullet iconJackson B and Owen JC (2019). Radically solvable graphs. Journal of Combinatorial Theory Series B, Elsevier vol. 136, 135-153.  
01-05-2019
bullet iconJackson B and Owen JC (2019). Equivalent realisations of a rigid graph. Discrete Applied Mathematics, Elsevier vol. 256, 42-58.  
01-03-2019
bullet iconEftekhari Y, Jackson B, Nixon A, Schulze B, Tanigawa S-I and Whiteley W (2019). Point-hyperplane frameworks, slider joints, and rigidity preserving transformations. Journal of Combinatorial Theory Series B, Elsevier vol. 135, 44-74.  
01-03-2019

2018

bullet iconJackson B, Kaszanitzky VE and Nixon A (2018). Rigid Cylindrical Frameworks with Two Coincident Points. Graphs and Combinatorics, Springer Nature vol. 35 (1), 141-168.  
30-11-2018
bullet iconCruickshank J, Guler H, Jackson B and Nixon A (2018). Rigidity of Linearly Constrained Frameworks. International Mathematics Research Notices, Oxford University Press (OUP) vol. 2020 (12), 3824-3840.  
08-08-2018

2016

bullet iconJackson B, Jordán T and Tanigawa S-I (2016). Unique low rank completability of partially filled matrices. Journal of Combinatorial Theory, Series B, Elsevier BV vol. 121, 432-462.  
01-11-2016
bullet iconBang-Jensen J, Bessy S, Jackson B and Kriesell M (2016). Antistrong digraphs. Journal of Combinatorial Theory, Series B 
24-05-2016
bullet iconJackson B and Owen JC (2016). A characterisation of the generic rigidity of 2-dimensional point-line frameworks. JOURNAL OF COMBINATORIAL THEORY SERIES B vol. 119, 96-121.  
01-01-2016

2015

bullet iconJackson B and Nixon A (2015). Stress Matrices and Global Rigidity of Frameworks on Surfaces. Discrete & Computational Geometry, Springer Nature vol. 54 (3), 586-609.  
20-08-2015
bullet iconJACKSON B (2015). Chromatic polynomials. Topics in Chromatic Graph Theory , Editors: Beineke L and Wilson RJ. 56-72.  
07-05-2015
bullet iconJackson B and Nguyen VH (2015). Graded sparse graphs and body-length-direction frameworks. European Journal of Combinatorics, Elsevier vol. 46, 51-67.  
01-05-2015

2014

bullet iconJackson B, Jordán T, Servatius B and Servatius H (2014). Henneberg moves on mechanisms. Beiträge zur Algebra und Geometrie / Contributions to Algebra and Geometry, Springer Nature vol. 56 (2), 587-591.  
09-09-2014
bullet iconJACKSON B, Jordan T and Szabadka Z (2014). Globally linked pairs of vertices in rigid framework. Rigidity and Symmetry , Editors: Connelly R, Ivic Weiss A and Whiteley W. 177-204.  
11-06-2014
bullet iconJackson B, McCourt TA and Nixon A (2014). Necessary Conditions for the Generic Global Rigidity of Frameworks on Surfaces. DISCRETE & COMPUTATIONAL GEOMETRY vol. 52 (2), 344-360.  
01-01-2014
bullet iconJackson B, Jordán T and Tanigawa S-I (2014). Combinatorial Conditions for the Unique Completability of Low-Rank Matrices. SIAM Journal on Discrete Mathematics, Society for Industrial & Applied Mathematics (SIAM) vol. 28 (4), 1797-1819.  
01-01-2014
bullet iconJackson B, Jordán T and Szabadka Z (2014). Globally linked pairs of vertices in rigid frameworks. Fields Institute Communications vol. 70, 177-203.  
01-01-2014

2013

bullet iconJackson B, Procacci A and Sokal AD (2013). Complex zero-free regions at large |q| for multivariate Tutte polynomials (alias Potts-model partition functions) with general complex edge weights. JOURNAL OF COMBINATORIAL THEORY SERIES B vol. 103 (1), 21-45.  
01-01-2013
bullet iconJackson B, Jordan T and Kiraly C (2013). Strongly rigid tensegrity graphs on the line. DISCRETE APPLIED MATHEMATICS vol. 161 (7-8), 1147-1149.  
01-01-2013
bullet iconJackson B (2013). Counting 2-connected deletion-minors of binary matroids. DISCRETE MATHEMATICS vol. 313 (11), 1262-1266.  
01-01-2013

2011

bullet iconJackson B (2011). Boundedness, rigidity and global rigidity of direction–length frameworks. Journal of Geometry, Springer Nature vol. 101 (1-2), 131-135.  
01-08-2011
bullet iconBilinski M, Jackson B, Ma J and Yu XX (2011). Circumference of 3-connected claw-free graphs and large Eulerian subgraphs of 3-edge-connected graphs. J COMB THEORY B vol. 101 (4), 214-236.  
01-07-2011
bullet iconJackson B and Keevash P (2011). Bounded Direction-Length Frameworks. DISCRETE COMPUT GEOM vol. 46 (1), 48-71.  
01-07-2011
bullet iconJackson B and Keevash P (2011). Necessary Conditions for the Global Rigidity of Direction-Length Frameworks. DISCRETE COMPUT GEOM vol. 46 (1), 72-85.  
01-07-2011
bullet iconDong FM and Jackson B (2011). A ZERO-FREE INTERVAL FOR CHROMATIC POLYNOMIALS OF NEARLY 3-CONNECTED PLANE GRAPHS. SIAM J DISCRETE MATH vol. 25 (3), 1103-1118.  
01-01-2011

2010

bullet iconJackson B and Jordan T (2010). OPERATIONS PRESERVING GLOBAL RIGIDITY OF GENERIC DIRECTION-LENGTH FRAMEWORKS. INT J COMPUT GEOM AP vol. 20 (6), 685-706.  
01-12-2010
bullet iconJackson B and Sokal AD (2010). Maxmaxflow and Counting Subgraphs. ELECTRON J COMB vol. 17 (1) 
10-07-2010
bullet iconKiraly Z, Cosh B and Jackson B (2010). Local edge-connectivity augmentation in hypergraphs is NP-complete. DISCRETE APPL MATH vol. 158 (6), 723-727.  
28-03-2010
bullet iconJackson B and Jordan T (2010). The generic rank of body-bar-and-hinge frameworks. EUR J COMBIN vol. 31 (2), 574-588.  
01-02-2010
bullet iconJackson B and Jordan T (2010). Brick partitions of graphs. DISCRETE MATHEMATICS vol. 310 (2), 270-275.  
28-01-2010
bullet iconJackson B and Jordan T (2010). Globally rigid circuits of the direction-length rigidity matroid. J COMB THEORY B vol. 100 (1), 1-22.  
01-01-2010
bullet iconJackson B (2010). AN INEQUALITY FOR TUTTE POLYNOMIALS. COMBINATORICA vol. 30 (1), 69-81.  
01-01-2010

2009

bullet iconJackson B and Sokal AD (2009). Zero-free regions for multivariate Tutte polynomials (alias Potts-model partition functions) of graphs and matroids. J COMB THEORY B vol. 99 (6), 869-903.  
01-11-2009
bullet iconJackson B and Yoshimoto K (2009). Spanning Even Subgraphs of 3-Edge-Connected Graphs. J GRAPH THEOR vol. 62 (1), 37-47.  
01-09-2009
bullet iconJACKSON B and Jordan T (2009). Graph theoretical techniques in the analysis of uniquely localizable sensor network. Localization Algorithms and Strategies for Wireless Sensor Networks: Monitoring and Surveillance Techniques for Target Tracking Monitoring and Surveillance Techniques for Target Tracking  146-173.  
31-05-2009
bullet iconJackson B and Jordan T (2009). A sufficient connectivity condition for generic rigidity in the plane. DISCRETE APPL MATH vol. 157 (8), 1965-1968.  
28-04-2009
bullet iconAbreu M, Aldred REL, Funk M, Jackson B, Labbate D and Sheehan J (2009). Graphs and digraphs with all 2-factors isomorphic (vol 92, pg 395, 2004). J COMB THEORY B vol. 99 (1), 271-273.  
01-01-2009

2008

bullet iconJackson B and Jordan T (2008). Pin-collinear body-and-pin frameworks and the molecular conjecture. DISCRETE COMPUT GEOM vol. 40 (2), 258-278.  
01-09-2008
bullet iconCameron PJ, Jackson B and Rudd JD (2008). Orbit-counting polynomials for graphs and codes. DISCRETE MATHEMATICS vol. 308 (5-6), 920-930.  
28-03-2008
bullet iconAbreu M, Diwan AA, Jackson B, Labbate D and Sheehan J (2008). Pseudo 2-factor isomorphic regular bipartite graphs. J COMB THEORY B vol. 98 (2), 432-442.  
01-03-2008
bullet iconJackson B and Jordan T (2008). ON THE RIGIDITY OF MOLECULAR GRAPHS. COMBINATORICA vol. 28 (6), 645-658.  
01-01-2008

2007

bullet iconFleischner H, Genest F and Jackson B (2007). Compatible circuit decompositions of 4-regular graphs. J GRAPH THEOR vol. 56 (3), 227-240.  
01-11-2007
bullet iconJackson B and Yoshimoto K (2007). Even subgraphs of bridgeless graphs and 2-factors of line graphs. DISCRETE MATH vol. 307 (22), 2775-2785.  
28-10-2007
bullet iconJackson B and Jordan T (2007). Rigid components in molecular graphs. ALGORITHMICA vol. 48 (4), 399-412.  
01-08-2007
bullet iconAldred REL and Jackson B (2007). Edge proximity conditions for extendability in cubic bipartite graphs. J GRAPH THEOR vol. 55 (2), 112-120.  
01-06-2007
bullet iconJackson B, Sethuraman G and Whitehead C (2007). A note on the Erdos-Farber-Lovasz conjecture. DISCRETE MATHEMATICS vol. 307 (7-8), 911-915.  
06-04-2007
bullet iconJackson B, Servatius B and Servatius H (2007). The 2-dimensional rigidity of certain families of graphs. J GRAPH THEOR vol. 54 (2), 154-166.  
01-02-2007
bullet iconJackson B (2007). Zero-free intervals for flow polynomials of near-cubic graphs. COMB PROBAB COMPUT vol. 16 (1), 85-108.  
01-01-2007
bullet iconJackson B (2007). A zero-free interval for flow polynomials of cubic graphs. J COMB THEORY B vol. 97 (1), 127-143.  
01-01-2007

2006

bullet iconJackson B and Jordan T (2006). On the rank function of the 3-dimensional rigidity matroid. INT J COMPUT GEOM AP vol. 16 (5-6), 415-429.  
01-12-2006
bullet iconJackson B, Jordan T and Szabadka Z (2006). Globally linked pairs of vertices in equivalent realizations of graphs. DISCRETE COMPUT GEOM vol. 35 (3), 493-512.  
01-03-2006

2005

bullet iconJackson B and Jordan T (2005). Rigid two-dimensional frameworks with three collinear points. GRAPH COMBINATOR vol. 21 (4), 427-444.  
01-12-2005
bullet iconJackson B and Jordan T (2005). The Dress conjectures on rank in the 3-dimensional rigidity matroid. ADV APPL MATH vol. 35 (4), 355-367.  
01-10-2005
bullet iconJackson B and Jordan T (2005). The d-dimensional rigidity matroid of sparse graphs. J COMB THEORY B vol. 95 (1), 118-133.  
01-09-2005
bullet iconJackson B and Jordan T (2005). Connected rigidity matroids and unique realizations of graphs. J COMB THEORY B vol. 94 (1), 1-29.  
01-05-2005
bullet iconJackson B and Jordan T (2005). Independence free graphs and vertex connectivity augmentation. J COMB THEORY B vol. 94 (1), 31-77.  
01-05-2005

2004

bullet iconAbreu M, Aldred REL, Funk M, Jackson B, Labbate D and Sheehan J (2004). Graphs and digraphs with all 2-factors isomorphic. J COMB THEORY B vol. 92 (2), 395-404.  
01-11-2004
bullet iconAldred REL, Funk M, Jackson B, Labbate D and Sheehan J (2004). Regular bipartite graphs with all 2-factors isomorphic. J COMB THEORY B vol. 92 (1), 151-161.  
01-09-2004

2003

bullet iconBerg AR, Jackson B and Jordan T (2003). Edge splitting and connectivity augmentation in directed hypergraphs. DISCRETE MATHEMATICS vol. 273 (1-3), 71-84.  
06-12-2003
bullet iconFunk M, Jackson B, Labbate D and Sheehan J (2003). Det-extremal cubic bipartite graphs. J GRAPH THEOR vol. 44 (1), 50-64.  
01-09-2003
bullet iconBerg AR, Jackson B and Jordan T (2003). Highly edge-connected detachments of graphs and digraphs. J GRAPH THEOR vol. 43 (1), 67-77.  
01-05-2003
bullet iconFunk M, Jackson B, Labbate D and Sheehan J (2003). 2-Factor hamiltonian graphs. J COMB THEORY B vol. 87 (1), 138-144.  
01-01-2003
bullet iconJackson B and Jordan T (2003). Non-separable detachments of graphs. J COMB THEORY B vol. 87 (1), 17-37.  
01-01-2003
bullet iconJACKSON WB (2003). Zeros of chromatic and flow polynomials of graphs. J. Geometry vol. 76, 95-109.  
01-01-2003

2002

bullet iconJackson B and Yu XX (2002). Hamilton cycles in plane triangulations. J GRAPH THEOR vol. 41 (2), 138-150.  
01-10-2002

2001

bullet iconJackson B and Jordán T (2001). Non-Separable Detachments of Graphs. Electronic Notes in Discrete Mathematics, Elsevier vol. 10, 151-153.  
01-11-2001
bullet iconJACKSON B and Jordan T (2001). Independence free graphs and vertex-connectivity augmentation., Editors: Aardal K. IPCO 2001
01-01-2001

2000

bullet iconBouchet A and Jackson B (2000). Parity systems and the delta-matroid intersection problem. Electronic Journal of Combinatorics vol. 7 (1 R), 1-23.  
01-12-2000
bullet iconJackson B and Jordán T (2000). Connectivity augmentation of graphs. Electronic Notes in Discrete Mathematics vol. 5, 1-4.  
01-12-2000
bullet iconJackson B and Jordánn T (2000). Connectivity Augmentation of Graphs. Electronic Notes in Discrete Mathematics, Elsevier vol. 5, 185-188.  
01-07-2000
bullet iconJackson B and Jordan T (2000). A near optimal algorithm for vertex connectivity augmentation., Editors: Lee DT and Teng SH. ISAAC 2000
01-01-2000

1999

bullet iconGODDYN LA and JACKSON B (1999). Removable Circuits in Binary Matroids. Combinatorics Probability Computing, Cambridge University Press (CUP) vol. 8 (6), 539-545.  
01-11-1999
bullet iconvan den Heuvel J and Jackson B (1999). On the Edge Connectivity, Hamiltonicity, and Toughness of Vertex-Transitive Graphs. Journal of Combinatorial Theory Series B, Elsevier vol. 77 (1), 138-149.  
01-09-1999
bullet iconBang-Jensen J and Jackson B (1999). Augmenting hypergraphs by edges of size two. Mathematical Programming, Springer Nature vol. 84 (3), 467-481.  
01-04-1999
bullet iconJackson B and Whitehead CA (1999). Some remarks on Jaeger's dual-hamiltonian conjecture. Annales de l’institut Fourier, Cellule MathDoc/CEDRAM vol. 49 (3), 921-926.  
01-01-1999
bullet iconJackson B (1999). INTEGER FLOWS AND CYCLE COVERS OF GRAPHS (Pure and Applied Mathematics 205). Bulletin of the London Mathematical Society, Wiley vol. 31 (1), 110-111.  
01-01-1999

1998

bullet iconBondy JA and Jackson B (1998). Vertices of Small Degree in Uniquely Hamiltonian Graphs. Journal of Combinatorial Theory Series B, Elsevier vol. 74 (2), 265-275.  
01-11-1998
bullet iconHochstättler W and Jackson B (1998). Large Circuits in Binary Matroids of Large Cogirth, I. Journal of Combinatorial Theory Series B, Elsevier vol. 74 (1), 35-52.  
01-09-1998
bullet iconHochstättler W and Jackson B (1998). Large Circuits in Binary Matroids of Large Cogirth, II. Journal of Combinatorial Theory Series B, Elsevier vol. 74 (1), 53-63.  
01-09-1998
bullet iconEDWARDS H, HIERONS R and JACKSON B (1998). The Zero-Free Intervals for Characteristic Polynomials of Matroids. Combinatorics Probability Computing, Cambridge University Press (CUP) vol. 7 (2), 153-165.  
01-06-1998

1997

bullet iconJackson B and Sheehan J (1997). The structure of transform graphs. Discrete Mathematics, Elsevier vol. 177 (1-3), 123-144.  
01-12-1997

1996

bullet iconJackson B and Wormald NC (1996). On the linear k-arboricity of cubic graphs. Discrete Mathematics, Elsevier vol. 162 (1-3), 293-297.  
01-12-1996
bullet iconBroersma HJ, van den Heuvel J, Jackson B and Veldman HJ (1996). Hamiltonicity of regular 2‐connected graphs. Journal of Graph Theory, Wiley vol. 22 (2), 105-124.  
01-06-1996
bullet iconAndersen LD, Bouchet A and Jackson B (1996). Orthogonal A-Trails of 4-Regular Graphs Embedded in Surfaces of Low Genus. Journal of Combinatorial Theory Series B, Elsevier vol. 66 (2), 232-246.  
01-03-1996

1995

bullet iconBang-Jensen J, Frank A and Jackson B (1995). Preserving and Increasing Local Edge-Connectivity in Mixed Graphs. SIAM Journal on Discrete Mathematics, Society for Industrial & Applied Mathematics (SIAM) vol. 8 (2), 155-178.  
01-05-1995
bullet iconJackson B and 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, Elsevier vol. 63 (2), 163-169.  
01-03-1995
bullet iconJackson B (1995). Cycles through vertices of large maximum degree. Journal of Graph Theory, Wiley vol. 19 (2), 157-168.  
01-03-1995

1994

bullet iconJackson B and Li H (1994). Hamilton Cycles in 2-Connected Regular Bipartite Graphs. Journal of Combinatorial Theory Series B, Elsevier vol. 62 (2), 236-258.  
01-11-1994
bullet iconJackson B (1994). Shortest Circuit Covers of Cubic Graphs. Journal of Combinatorial Theory Series B, Elsevier vol. 60 (2), 299-307.  
01-03-1994
bullet iconJACKSON B and KATERINIS P (1994). A CHARACTERIZATION OF 3/2-TOUGH CUBIC GRAPHS. ARS COMBINATORIA vol. 38, 145-148.  
01-01-1994

1993

bullet iconJackson B (1993). A Zero-Free Interval for Chromatic Polynomials of Graphs. Combinatorics Probability Computing, Cambridge University Press (CUP) vol. 2 (3), 325-336.  
01-09-1993
bullet iconJackson B (1993). Hamilton Cycles in Almost-Regular 2-Connected Graphs. Journal of Combinatorial Theory Series B, Elsevier vol. 57 (1), 77-87.  
01-01-1993
bullet iconJACKSON B (1993). On circuit covers, circuit decompositions and Euler tours of graphs. Surveys in Combinatorics 1993 , Editors: Walker K. 191-210.  
01-01-1993

1992

bullet iconJACKSON B and Wormald NC (1992). Longest cycles in 3-connected graphs of bounded max- imum degree. Graphs, Matrices, and Designs , Editors: Rees RS. 
25-09-1992
bullet iconJackson B, Li H and Zhu Y (1992). Dominating cycles in regular 3-connected graphs. Discrete Mathematics, Elsevier vol. 102 (2), 163-176.  
01-05-1992
bullet iconJackson B and Wormald NC (1992). Longest cycles in 3-connected planar graphs. Journal of Combinatorial Theory Series B, Elsevier vol. 54 (2), 291-321.  
01-03-1992

1991

bullet iconJackson B (1991). Supplementary Eulerian vectors in isotropic systems. Journal of Combinatorial Theory Series B, Elsevier vol. 53 (1), 93-105.  
01-09-1991
bullet iconJackson B (1991). Neighborhood unions and hamilton cycles. Journal of Graph Theory, Wiley vol. 15 (4), 443-451.  
01-09-1991
bullet iconJackson B (1991). A characterisation of graphs having three pairwise compatible Euler tours. Journal of Combinatorial Theory Series B, Elsevier vol. 53 (1), 80-92.  
01-09-1991
bullet iconAldred REL, Holton DA and Jackson B (1991). Uniform cyclic edge connectivity in cubic graphs. Combinatorica, Springer Nature vol. 11 (2), 81-96.  
01-06-1991
bullet iconAldred REL, Jackson B, Lou D and Saito A (1991). Partitioning regular graphs into equicardinal linear forests. Discrete Mathematics, Elsevier vol. 88 (1), 1-9.  
01-03-1991

1990

bullet iconJackson B and Ordaz O (1990). Chvátal-Erdős conditions for paths and cycles in graphs and digraphs. A survey. Discrete Mathematics, Elsevier vol. 84 (3), 241-254.  
01-10-1990
bullet iconHolton DA, Jackson B, Saito A and Wormald NC (1990). Removable edges in 3‐connected graphs. Journal of Graph Theory, Wiley vol. 14 (4), 465-473.  
01-09-1990
bullet iconJackson B (1990). Shortest Circuit Covers and Postman Tours in Graphs with a Nowhere Zero 4. SIAM Journal on Computing, Society for Industrial & Applied Mathematics (SIAM) vol. 19 (4), 659-665.  
01-08-1990
bullet iconHahn G and Jackson B (1990). A note concerning paths and independence number in digraphs. Discrete Mathematics, Elsevier vol. 82 (3), 327-329.  
01-06-1990
bullet iconJackson B and Wormald NC (1990). Cycles containing matchings and pairwise compatible euler tours. Journal of Graph Theory, Wiley vol. 14 (1), 127-138.  
01-03-1990
bullet iconFleischner H, Hilton AJW and Jackson B (1990). On the maximum number of pairwise compatible euler cycles. Journal of Graph Theory, Wiley vol. 14 (1), 51-63.  
01-03-1990
bullet iconJACKSON B (1990). Compatible Euler tours in Eulerian digraphs. Cycles and Rays , Editors: Hahn G, Sabidussi G and Woodrow R. 95-100.  
01-01-1990
bullet iconJACKSON B and Wormald NC (1990). K-walks. Australasian J. of Combinatorics vol. 2, 135-146.  
01-01-1990

1989

bullet iconJackson B and Whitty RW (1989). A note concerning graphs with unique f‐factors. Journal of Graph Theory, Wiley vol. 13 (5), 577-580.  
01-11-1989

1988

bullet iconAndersen LD, Fleischner H and Jackson B (1988). Removable edges in cyclically 4-edge-connected cubic graphs. Graphs and Combinatorics, Springer Nature vol. 4 (1), 1-21.  
01-12-1988
bullet iconFrieze AM, Jackson B, McDiarmid CJH and Reed B (1988). Edge-colouring random graphs. Journal of Combinatorial Theory Series B, Elsevier vol. 45 (2), 135-149.  
01-10-1988
bullet iconJackson B (1988). Some remarks on Arc‐connectivity, vertex splitting, and orientation in graphs and digraphs. Journal of Graph Theory, Wiley vol. 12 (3), 429-436.  
01-09-1988
bullet iconJACKSON B and ORDAZ O (1988). CHVATAL-ERDOS CONDITIONS FOR 2-CYCLABILITY IN DIGRAPHS. ARS COMBINATORIA vol. 25, 39-49.  
01-01-1988
bullet iconFleischner H and Jackson B (1988). A Note Concerning some Conjectures on Cyclically 4–Edge Connected 3–Regular Graphs. Graph Theory in Memory of G.A. Dirac  171-177.  
01-01-1988

1987

bullet iconJackson B (1987). A Chvátal-Erdös condition for hamilton cycles in digraphs. Journal of Combinatorial Theory Series B, Elsevier vol. 43 (3), 245-252.  
01-12-1987
bullet iconHilton AJW and Jackson B (1987). A note concerning the chromatic index of multigraphs. Journal of Graph Theory, Wiley vol. 11 (3), 267-272.  
01-09-1987
bullet iconFrieze AM and Jackson B (1987). Large holes in sparse random graphs. Combinatorica, Springer Nature vol. 7 (3), 265-274.  
01-09-1987
bullet iconJackson B (1987). Compatible Euler tours for transition systems in Eulerian graphs. Discrete Mathematics, Elsevier vol. 66 (1-2), 127-131.  
01-08-1987
bullet iconFrieze AM and Jackson B (1987). Large induced trees in sparse random graphs. Journal of Combinatorial Theory Series B, Elsevier vol. 42 (2), 181-195.  
01-04-1987
bullet iconFleischner H and Jackson B (1987). Compatible path-cycle-decompositions of plane graphs. Journal of Combinatorial Theory Series B, Elsevier vol. 42 (1), 94-121.  
01-02-1987

1986

bullet iconJackson B (1986). Longest cycles in 3-connected cubic graphs. Journal of Combinatorial Theory Series B, Elsevier vol. 41 (1), 17-26.  
01-08-1986

1985

bullet iconJackson B and Ordaz O (1985). A Chvátal-Erdös condition for (1,1)-factors in digraphs. Discrete Mathematics, Elsevier vol. 57 (1-2), 199-201.  
01-11-1985
bullet iconFleischner H and Jackson B (1985). Removable Cycles in Planar Graphs. Journal of the London Mathematical Society, Wiley vol. s2-31 (2), 193-199.  
01-04-1985
bullet iconJackson B (1985). Long cycles in bipartite graphs. Journal of Combinatorial Theory Series B, Elsevier vol. 38 (2), 118-131.  
01-04-1985
bullet iconEnomoto H, Jackson B, Katerinis P and Saito A (1985). Toughness and the existence of k‐factors. Journal of Graph Theory, Wiley vol. 9 (1), 87-95.  
01-03-1985
bullet iconBondy JA and Jackson B (1985). Long Paths Between Specified Vertices of a Block. Annals of Discrete Mathematics (27): Cycles in Graphs  195-200.  
01-01-1985
bullet iconHäggkvist R and Jackson B (1985). A Note on Maximal Cycles in 2-Connected Graphs. Annals of Discrete Mathematics (27): Cycles in Graphs  205-208.  
01-01-1985

1983

bullet iconBermond JC, Jackson B and Jaeger F (1983). Shortest coverings of graphs with cycles. Journal of Combinatorial Theory Series B, Elsevier vol. 35 (3), 297-308.  
01-12-1983
bullet iconJackson B (1983). Maximal Cycles in Bipartite Graphs. Combinatorial Mathematics, Proceedings of the International Colloquium on Graph Theory and Combinatorics  361-363.  
01-01-1983

1982

bullet iconEdwards JA, Hamilton GM, Hilton AJW and Jackson B (1982). Domino Squares. 
01-01-1982

1981

bullet iconJackson B (1981). Long paths and cycles in oriented graphs. Journal of Graph Theory, Wiley vol. 5 (2), 145-157.  
01-06-1981
bullet iconJackson B (1981). Cycles in bipartite graphs. Journal of Combinatorial Theory Series B, Elsevier vol. 30 (3), 332-342.  
01-06-1981

1980

bullet iconJackson B (1980). Hamilton cycles in regular 2-connected graphs. Journal of Combinatorial Theory Series B, Elsevier vol. 29 (1), 27-46.  
01-08-1980
bullet iconJackson B (1980). Removable Cycles in 2‐Connected Graphs of Minimum Degree at Least Four. Journal of the London Mathematical Society, Wiley vol. s2-21 (3), 385-392.  
01-06-1980
bullet iconJackson B (1980). Paths and Cycles in Oriented Graphs. 
01-01-1980

1979

bullet iconJackson B (1979). Edge‐Disjoint Hamilton Cycles in Regular Graphs of Large Degree. Journal of the London Mathematical Society, Wiley vol. s2-19 (1), 13-16.  
01-02-1979

1978

bullet iconJackson B (1978). Hamilton cycles in regular graphs. Journal of Graph Theory, Wiley vol. 2 (4), 363-365.  
01-12-1978

Grants

solid heart iconGrants of specific relevance to the Centre for Combinatorics, Algebra and Number Theory
solid heart iconVisits to Tokyo: Matroid Elevations and Rigid Frameworks
William Jackson
£58,159 EPSRC Engineering and Physical Sciences Research Council (01-03-2021 - 28-03-2024)