default search action
Bill Jackson
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
showing all ?? records
2020 – today
- 2024
- [j118]Bill Jackson
, Shin-ichi Tanigawa:
Maximal matroids in weak order posets. J. Comb. Theory B 165: 20-46 (2024) - 2023
- [j117]James Cruickshank
Vertex Splitting, Coincident Realisations, and Global Rigidity of Braced Triangulations. Discret. Comput. Geom. 69(1): 192-208 (2023) - [j116]Robert E. L. Aldred
Edge proximity conditions for extendability in regular bipartite graphs. J. Graph Theory 104(2): 282-288 (2023) - 2022
- [j115]Hakan Guler
Coincident Rigidity of 2-Dimensional Frameworks. Graphs Comb. 38(4): 128 (2022) - [j114]Hakan Guler
A necessary condition for generic rigidity of bar-and-joint frameworks in d-space. J. Graph Theory 99(2): 231-239 (2022) - [j113]Georg Grasegger
Flexible circuits in the d-dimensional rigidity matroid. J. Graph Theory 100(2): 315-330 (2022) - 2021
- [j112]Bill Jackson, Anthony Nixon
An Improved Bound for the Rigidity of Linearly Constrained Frameworks. SIAM J. Discret. Math. 35(2): 928-933 (2021) - 2020
- [j111]Katie Clinch
Global rigidity of direction-length frameworks. J. Comb. Theory B 145: 145-168 (2020)
2010 – 2019
- 2019
- [j110]Bill Jackson, J. C. Owen:
Equivalent realisations of a rigid graph. Discret. Appl. Math. 256: 42-58 (2019) - [j109]Bill Jackson, Viktória E. Kaszanitzky, Anthony Nixon
Rigid Cylindrical Frameworks with Two Coincident Points. Graphs Comb. 35(1): 141-168 (2019) - [j108]Yaser Eftekhari, Bill Jackson, Anthony Nixon
Point-hyperplane frameworks, slider joints, and rigidity preserving transformations. J. Comb. Theory B 135: 44-74 (2019) - [j107]Bill Jackson, J. C. Owen:
Radically solvable graphs. J. Comb. Theory B 136: 135-153 (2019) - [j106]Bill Jackson, Anthony Nixon
Global rigidity of generic frameworks on the cylinder. J. Comb. Theory B 139: 193-229 (2019) - 2017
- [j105]Jørgen Bang-Jensen
Antistrong digraphs. J. Comb. Theory B 122: 68-90 (2017) - 2016
- [j104]Bill Jackson, J. C. Owen:
A characterisation of the generic rigidity of 2-dimensional point-line frameworks. J. Comb. Theory B 119: 96-121 (2016) - [j103]Bill Jackson, Tibor Jordán, Shin-ichi Tanigawa:
Unique low rank completability of partially filled matrices. J. Comb. Theory B 121: 432-462 (2016) - 2015
- [j102]Bill Jackson, Anthony Nixon
Stress Matrices and Global Rigidity of Frameworks on Surfaces. Discret. Comput. Geom. 54(3): 586-609 (2015) - [j101]Bill Jackson, Viet Hang Nguyen:
Graded sparse graphs and body-length-direction frameworks. Eur. J. Comb. 46: 51-67 (2015) - 2014
- [j100]Bill Jackson, Thomas A. McCourt, Anthony Nixon
Necessary Conditions for the Generic Global Rigidity of Frameworks on Surfaces. Discret. Comput. Geom. 52(2): 344-360 (2014) - [j99]Bill Jackson, Tibor Jordán, Shin-ichi Tanigawa:
Combinatorial Conditions for the Unique Completability of Low-Rank Matrices. SIAM J. Discret. Math. 28(4): 1797-1819 (2014) - 2013
- [j98]Bill Jackson, Tibor Jordán, Csaba Király
Strongly rigid tensegrity graphs on the line. Discret. Appl. Math. 161(7-8): 1147-1149 (2013) - [j97]Bill Jackson:
Counting 2-connected deletion-minors of binary matroids. Discret. Math. 313(11): 1262-1266 (2013) - [j96]Bill Jackson, Aldo Procacci
Complex zero-free regions at large |q| for multivariate Tutte polynomials (alias Potts-model partition functions) with general complex edge weights. J. Comb. Theory B 103(1): 21-45 (2013) - 2011
- [j95]Bill Jackson, Peter Keevash:
Bounded Direction-Length Frameworks. Discret. Comput. Geom. 46(1): 48-71 (2011) - [j94]Bill Jackson, Peter Keevash:
Necessary Conditions for the Global Rigidity of Direction-Length Frameworks. Discret. Comput. Geom. 46(1): 72-85 (2011) - [j93]Mark Bilinski
Circumference of 3-connected claw-free graphs and large Eulerian subgraphs of 3-edge-connected graphs. J. Comb. Theory B 101(4): 214-236 (2011) - [j92]Feng Ming Dong
A Zero-Free Interval for Chromatic Polynomials of Nearly 3-Connected Plane Graphs. SIAM J. Discret. Math. 25(3): 1103-1118 (2011) - 2010
- [j91]Bill Jackson:
An inequality for Tutte polynomials. Comb. 30(1): 69-81 (2010) - [j90]Bill Jackson, Alan D. Sokal:
Maxmaxflow and Counting Subgraphs. Electron. J. Comb. 17(1) (2010) - [j89]Zoltán Király
Local edge-connectivity augmentation in hypergraphs is NP-complete. Discret. Appl. Math. 158(6): 723-727 (2010) - [j88]Bill Jackson, Tibor Jordán:
Brick partitions of graphs. Discret. Math. 310(2): 270-275 (2010) - [j87]Bill Jackson, Tibor Jordán:
The generic rank of body-bar-and-hinge frameworks. Eur. J. Comb. 31(2): 574-588 (2010) - [j86]Bill Jackson, Tibor Jordán:
Operations Preserving Global Rigidity of Generic Direction-Length Frameworks. Int. J. Comput. Geom. Appl. 20(6): 685-706 (2010) - [j85]Bill Jackson, Tibor Jordán:
Globally rigid circuits of the direction-length rigidity matroid. J. Comb. Theory B 100(1): 1-22 (2010)
2000 – 2009
- 2009
- [j84]Bill Jackson, Tibor Jordán:
A sufficient connectivity condition for generic rigidity in the plane. Discret. Appl. Math. 157(8): 1965-1968 (2009) - [j83]Marién Abreu
Corrigendum to "Graphs and digraphs with all 2-factors isomorphic" [J. Combin. Theory Ser. B 92 (2) (2004) 395-404]. J. Comb. Theory B 99(1): 271-273 (2009) - [j82]Bill Jackson, Alan D. Sokal
Zero-free regions for multivariate Tutte polynomials (alias Potts-model partition functions) of graphs and matroids. J. Comb. Theory B 99(6): 869-903 (2009) - [j81]Bill Jackson, Kiyoshi Yoshimoto:
Spanning even subgraphs of 3-edge-connected graphs. J. Graph Theory 62(1): 37-47 (2009) - 2008
- [j80]Bill Jackson, Tibor Jordán:
On the rigidity of molecular graphs. Comb. 28(6): 645-658 (2008) - [j79]Bill Jackson, Tibor Jordán:
Pin-Collinear Body-and-Pin Frameworks and the Molecular Conjecture. Discret. Comput. Geom. 40(2): 258-278 (2008) - [j78]Peter J. Cameron
Orbit-counting polynomials for graphs and codes. Discret. Math. 308(5-6): 920-930 (2008) - [j77]Marién Abreu
Pseudo 2-factor isomorphic regular bipartite graphs. J. Comb. Theory B 98(2): 432-442 (2008) - 2007
- [j76]Bill Jackson, Tibor Jordán:
Rigid Components in Molecular Graphs. Algorithmica 48(4): 399-412 (2007) - [j75]Bill Jackson:
Zero-Free Intervals for Flow Polynomials of Near-Cubic Graphs. Comb. Probab. Comput. 16(1): 85-108 (2007) - [j74]Bill Jackson, G. Sethuraman, Carol A. Whitehead:
A note on the Erdos-Farber-Lovász conjecture. Discret. Math. 307(7-8): 911-915 (2007) - [j73]Bill Jackson, Kiyoshi Yoshimoto:
Even subgraphs of bridgeless graphs and 2-factors of line graphs. Discret. Math. 307(22): 2775-2785 (2007) - [j72]Bill Jackson:
A zero-free interval for flow polynomials of cubic graphs. J. Comb. Theory B 97(1): 127-143 (2007) - [j71]Bill Jackson, Brigitte Servatius
The 2-dimensional rigidity of certain families of graphs. J. Graph Theory 54(2): 154-166 (2007) - [j70]Robert E. L. Aldred, Bill Jackson:
Edge proximity conditions for extendability in cubic bipartite graphs. J. Graph Theory 55(2): 112-120 (2007) - [j69]Herbert Fleischner, François Genest, Bill Jackson:
Compatible circuit decompositions of 4-regular graphs. J. Graph Theory 56(3): 227-240 (2007) - 2006
- [j68]Bill Jackson, Tibor Jordán, Zoltan Szabadka:
Globally Linked Pairs of Vertices in Equivalent Realizations of Graphs. Discret. Comput. Geom. 35(3): 493-512 (2006) - [j67]Bill Jackson, Tibor Jordán:
On the Rank Function of the 3-dimensional Rigidity Matroid. Int. J. Comput. Geom. Appl. 16(5-6): 415-430 (2006) - 2005
- [j66]Bill Jackson, Tibor Jordán:
The Dress conjectures on rank in the 3-dimensional rigidity matroid. Adv. Appl. Math. 35(4): 355-367 (2005) - [j65]Bill Jackson, Tibor Jordán:
Rigid Two-Dimensional Frameworks with Three Collinear Points. Graphs Comb. 21(4): 427-444 (2005) - [j64]Bill Jackson, Tibor Jordán:
Connected rigidity matroids and unique realizations of graphs. J. Comb. Theory B 94(1): 1-29 (2005) - [j63]Bill Jackson, Tibor Jordán:
Independence free graphs and vertex connectivity augmentation. J. Comb. Theory B 94(1): 31-77 (2005) - [j62]Bill Jackson, Tibor Jordán:
The d-dimensional rigidity matroid of sparse graphs. J. Comb. Theory B 95(1): 118-133 (2005) - 2004
- [j61]Robert E. L. Aldred, Martin Funk
Regular bipartite graphs with all 2-factors isomorphic. J. Comb. Theory B 92(1): 151-161 (2004) - [j60]Marién Abreu
Graphs and digraphs with all 2-factors isomorphic. J. Comb. Theory B 92(2): 395-404 (2004) - 2003
- [j59]Alex R. Berg, Bill Jackson, Tibor Jordán:
Edge splitting and connectivity augmentation in directed hypergraphs. Discret. Math. 273(1-3): 71-84 (2003) - [j58]Bill Jackson, Tibor Jordán:
Non-separable detachments of graphs. J. Comb. Theory B 87(1): 17-37 (2003) - [j57]Martin Funk
2-Factor hamiltonian graphs. J. Comb. Theory B 87(1): 138-144 (2003) - [j56]Alex R. Berg, Bill Jackson, Tibor Jordán:
Highly edge-connected detachments of graphs and digraphs. J. Graph Theory 43(1): 67-77 (2003) - [j55]Martin Funk
Det-extremal cubic bipartite graphs. J. Graph Theory 44(1): 50-64 (2003) - 2002
- [j54]Bill Jackson, Xingxing Yu:
Hamilton cycles in plane triangulations. J. Graph Theory 41(2): 138-150 (2002) - 2001
- [j53]Bill Jackson, Tibor Jordán:
Non-Separable Detachments of Graphs. Electron. Notes Discret. Math. 10: 151-153 (2001) - [c2]Bill Jackson, Tibor Jordán:
Independence Free Graphs and Vertex Connectivity Augmentation. IPCO 2001: 264-279 - 2000
- [j52]André Bouchet, Bill Jackson:
Parity Systems and the Delta-Matroid Intersection Problem. Electron. J. Comb. 7 (2000) - [j51]Bill Jackson, Tibor Jordán:
Connectivity Augmentation of Graphs. Electron. Notes Discret. Math. 5: 185-188 (2000) - [c1]Bill Jackson, Tibor Jordán:
A Near Optimal Algorithm for Vertex Connectivity Augmentation. ISAAC 2000: 312-325
1990 – 1999
- 1999
- [j50]Jan van den Heuvel, Bill Jackson:
On the Edge Connectivity, Hamiltonicity, and Toughness of Vertex-Transitive Graphs. J. Comb. Theory B 77(1): 138-149 (1999) - [j49]Jørgen Bang-Jensen
Augmenting hypergraphs by edges of size two. Math. Program. 84(3): 467-481 (1999) - 1998
- [j48]Hugh Edwards, Robert M. Hierons, Bill Jackson:
The Zero-Free Intervals for Characteristic Polynomials of Matroids. Comb. Probab. Comput. 7(2): 153-165 (1998) - [j47]Winfried Hochstättler, Bill Jackson:
Large Circuits in Binary Matroids of Large Cogirth, I. J. Comb. Theory B 74(1): 35-52 (1998) - [j46]Winfried Hochstättler, Bill Jackson:
Large Circuits in Binary Matroids of Large Cogirth, II. J. Comb. Theory B 74(1): 53-63 (1998) - [j45]J. Adrian Bondy, Bill Jackson:
Vertices of Small Degree in Uniquely Hamiltonian Graphs. J. Comb. Theory B 74(2): 265-275 (1998) - 1997
- [j44]Bill Jackson, John Sheehan:
The structure of transform graphs. Discret. Math. 177(1-3): 123-144 (1997) - 1996
- [j43]Bill Jackson, Nicholas C. Wormald:
On the linear k-arboricity of cubic graphs. Discret. Math. 162(1-3): 293-297 (1996) - [j42]Lars Døvling Andersen, André Bouchet, Bill Jackson:
Orthogonal A-Trails of 4-Regular Graphs Embedded in Surfaces of Low Genus. J. Comb. Theory B 66(2): 232-246 (1996) - [j41]Haitze J. Broersma, Jan van den Heuvel, Bill Jackson, Henk Jan Veldman:
Hamiltonicity of regular 2-connected graphs. J. Graph Theory 22(2): 105-124 (1996) - 1995
- [j40]Bill Jackson, Nicholas C. Wormald:
Long Cycles and 3-Connected Spanning Subgraphs of Bounded Degree in 3-Connected K1, d-Free Graphs. J. Comb. Theory B 63(2): 163-169 (1995) - [j39]Bill Jackson:
Cycles through vertices of large maximum degree. J. Graph Theory 19(2): 157-168 (1995) - [j38]Jørgen Bang-Jensen, András Frank
Preserving and Increasing Local Edge-Connectivity in Mixed Graphs. SIAM J. Discret. Math. 8(2): 155-178 (1995) - 1994
- [j37]Bill Jackson:
Shortest Circuit Covers of Cubic Graphs. J. Comb. Theory B 60(2): 299-307 (1994) - [j36]Bill Jackson, Hao Li:
Hamilton Cycles in 2-Connected Regular Bipartite Graphs. J. Comb. Theory B 62(2): 236-258 (1994) - 1993
- [j35]Bill Jackson:
A Zero-Free Interval for Chromatic Polynomials of Graphs. Comb. Probab. Comput. 2: 325-336 (1993) - [j34]Bill Jackson:
Hamilton Cycles in Almost-Regular 2-Connected Graphs. J. Comb. Theory B 57(1): 77-87 (1993) - 1992
- [j33]Bill Jackson, Hao Li, Yongjin Zhu:
Dominating cycles in regular 3-connected graphs. Discret. Math. 102(2): 163-176 (1992) - [j32]Bill Jackson, Nicholas C. Wormald:
Longest cycles in 3-connected planar graphs. J. Comb. Theory B 54(2): 291-321 (1992) - 1991
- [j31]Robert E. L. Aldred, Derek A. Holton, Bill Jackson:
Uniform cyclic edge connectivity in cubic graphs. Comb. 11(2): 81-96 (1991) - [j30]Robert E. L. Aldred, Bill Jackson, Dingjun Lou, Akira Saito:
Partitioning regular graphs into equicardinal linear forests. Discret. Math. 88(1): 1-9 (1991) - [j29]Bill Jackson:
A characterisation of graphs having three pairwise compatible Euler tours. J. Comb. Theory B 53(1): 80-92 (1991) - [j28]Bill Jackson:
Supplementary Eulerian vectors in isotropic systems. J. Comb. Theory B 53(1): 93-105 (1991) - [j27]Bill Jackson:
Neighborhood unions and hamilton cycles. J. Graph Theory 15(4): 443-451 (1991) - 1990
- [j26]Bill Jackson, Nicholas C. Wormald:
k-walks of graphs. Australas. J Comb. 2: 135-146 (1990) - [j25]Gena Hahn, Bill Jackson:
A note concerning paths and independence number in digraphs. Discret. Math. 82(3): 327-329 (1990) - [j24]Bill Jackson, Oscar Ordaz:
Chvátal-Erdös conditions for paths and cycles in graphs and digraphs. A survey. Discret. Math. 84(3): 241-254 (1990) - [j23]Herbert Fleischner, Anthony J. W. Hilton, Bill Jackson:
On the maximum number of pairwise compatible euler cycles. J. Graph Theory 14(1): 51-63 (1990) - [j22]Bill Jackson, Nicholas C. Wormald:
Cycles containing matchings and pairwise compatible euler tours. J. Graph Theory 14(1): 127-138 (1990) - [j21]Derek A. Holton, Bill Jackson, Akira Saito, Nicholas C. Wormald:
Removable edges in 3-connected graphs. J. Graph Theory 14(4): 465-473 (1990) - [j20]Bill Jackson:
Shortest Circuit Covers and Postman Tours in Graphs with a Nowhere Zero 4-Flow. SIAM J. Comput. 19(4): 659-665 (1990)
1980 – 1989
- 1989
- [j19]Bill Jackson, Robin W. Whitty:
A note concerning graphs with unique f-factors. J. Graph Theory 13(5): 577-580 (1989) - 1988
- [j18]Lars Døvling Andersen, Herbert Fleischner, Bill Jackson:
Removable edges in cyclically 4-edge-connected cubic graphs. Graphs Comb. 4(1): 1-21 (1988) - [j17]Alan M. Frieze
Edge-colouring random graphs. J. Comb. Theory B 45(2): 135-149 (1988) - [j16]Bill Jackson:
Some remarks on Arc-connectivity, vertex splitting, and orientation in graphs and digraphs. J. Graph Theory 12(3): 429-436 (1988) - 1987
- [j15]Alan M. Frieze
Large holes in sparse random graphs. Comb. 7(3): 265-274 (1987) - [j14]Bill Jackson:
Compatible Euler tours for transition systems in Eulerian graphs. Discret. Math. 66(1-2): 127-131 (1987) - [j13]Herbert Fleischner, Bill Jackson:
Compatible path-cycle-decompositions of plane graphs. J. Comb. Theory B 42(1): 94-121 (1987) - [j12]Alan M. Frieze
Large induced trees in sparse random graphs. J. Comb. Theory B 42(2): 181-195 (1987) - [j11]Bill Jackson:
A Chvátal-Erdös condition for hamilton cycles in digraphs. J. Comb. Theory B 43(3): 245-252 (1987) - [j10]Anthony J. W. Hilton, Bill Jackson:
A note concerning the chromatic index of multigraphs. J. Graph Theory 11(3): 267-272 (1987) - 1986
- [j9]Bill Jackson:
Longest cycles in 3-connected cubic graphs. J. Comb. Theory B 41(1): 17-26 (1986) - 1985
- [j8]Bill Jackson, Oscar Ordaz:
A Chvátal-Erdös condition for (1, 1)-factors in digraphs. Discret. Math. 57(1-2): 199-201 (1985) - [j7]Bill Jackson:
Long cycles in bipartite graphs. J. Comb. Theory B 38(2): 118-131 (1985) - [j6]Hikoe Enomoto, Bill Jackson, P. Katerinis, Akira Saito:
Toughness and the existence of k-factors. J. Graph Theory 9(1): 87-95 (1985) - 1983
- [j5]Jean-Claude Bermond, Bill Jackson, François Jaeger:
Shortest coverings of graphs with cycles. J. Comb. Theory B 35(3): 297-308 (1983) - 1981
- [j4]Bill Jackson:
Cycles in bipartite graphs. J. Comb. Theory B 30(3): 332-342 (1981) - [j3]Bill Jackson:
Long paths and cycles in oriented graphs. J. Graph Theory 5(2): 145-157 (1981) - 1980
- [j2]Bill Jackson:
Hamilton cycles in regular 2-connected graphs. J. Comb. Theory B 29(1): 27-46 (1980)
1970 – 1979
- 1978
- [j1]Bill Jackson:
Hamilton cycles in regular graphs. J. Graph Theory 2(4): 363-365 (1978)
Coauthor Index
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
Unpaywalled article links
Add open access links from to the list of external document links (if available).
Privacy notice: By enabling the option above, your browser will contact the API of unpaywall.org to load hyperlinks to open access articles. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Unpaywall privacy policy.
Archived links via Wayback Machine
For web page which are no longer available, try to retrieve content from the of the Internet Archive (if available).
Privacy notice: By enabling the option above, your browser will contact the API of archive.org to check for archived content of web pages that are no longer available. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Internet Archive privacy policy.
Reference lists
Add a list of references from ,
, and
to record detail pages.
load references from crossref.org and opencitations.net
Privacy notice: By enabling the option above, your browser will contact the APIs of crossref.org, opencitations.net, and semanticscholar.org to load article reference information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Crossref privacy policy and the OpenCitations privacy policy, as well as the AI2 Privacy Policy covering Semantic Scholar.
Citation data
Add a list of citing articles from and
to record detail pages.
load citations from opencitations.net
Privacy notice: By enabling the option above, your browser will contact the API of opencitations.net and semanticscholar.org to load citation information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the OpenCitations privacy policy as well as the AI2 Privacy Policy covering Semantic Scholar.
OpenAlex data
Load additional information about publications from .
Privacy notice: By enabling the option above, your browser will contact the API of openalex.org to load additional information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the information given by OpenAlex.
last updated on 2024-06-10 20:30 CEST by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by: