Bill Jackson

	2011
76		Bill Jackson, Peter Keevash: Bounded Direction-Length Frameworks. Discrete & Computational Geometry 46(1): 48-71 (2011)
75		Bill Jackson, Peter Keevash: Necessary Conditions for the Global Rigidity of Direction-Length Frameworks. Discrete & Computational Geometry 46(1): 72-85 (2011)
74		Mark Bilinski, Bill Jackson, Jie Ma, Xingxing Yu: Circumference of 3-connected claw-free graphs and large Eulerian subgraphs of 3-edge-connected graphs. J. Comb. Theory, Ser. B 101(4): 214-236 (2011)
73		F. M. Dong, Bill Jackson: A Zero-Free Interval for Chromatic Polynomials of Nearly 3-Connected Plane Graphs. SIAM J. Discrete Math. 25(3): 1103-1118 (2011)
	2010
72		Bill Jackson: An inequality for Tutte polynomials. Combinatorica 30(1): 69-81 (2010)
71		Zoltán Király, Ben Cosh, Bill Jackson: Local edge-connectivity augmentation in hypergraphs is NP-complete. Discrete Applied Mathematics 158(6): 723-727 (2010)
70		Bill Jackson, Tibor Jordán: Brick partitions of graphs. Discrete Mathematics 310(2): 270-275 (2010)
69		Bill Jackson, Alan D. Sokal: Maxmaxflow and Counting Subgraphs. Electr. J. Comb. 17(1): (2010)
68		Bill Jackson, Tibor Jordán: The generic rank of body-bar-and-hinge frameworks. Eur. J. Comb. 31(2): 574-588 (2010)
67		Bill Jackson, Tibor Jordán: Operations Preserving Global Rigidity of Generic Direction-Length Frameworks. Int. J. Comput. Geometry Appl. 20(6): 685-706 (2010)
66		Bill Jackson, Tibor Jordán: Globally rigid circuits of the direction-length rigidity matroid. J. Comb. Theory, Ser. B 100(1): 1-22 (2010)
	2009
65		Bill Jackson, Tibor Jordán: A sufficient connectivity condition for generic rigidity in the plane. Discrete Applied Mathematics 157(8): 1965-1968 (2009)
64		Marien Abreu, Robert E. L. Aldred, Martin Funk, Bill Jackson, Domenico Labbate, John Sheehan: Corrigendum to "Graphs and digraphs with all 2-factors isomorphic" [J. Combin. Theory Ser. B 92 (2) (2004) 395-404]. J. Comb. Theory, Ser. B 99(1): 271-273 (2009)
63		Bill Jackson, Alan D. Sokal: Zero-free regions for multivariate Tutte polynomials (alias Potts-model partition functions) of graphs and matroids. J. Comb. Theory, Ser. B 99(6): 869-903 (2009)
62		Bill Jackson, Kiyoshi Yoshimoto: Spanning even subgraphs of 3-edge-connected graphs. Journal of Graph Theory 62(1): 37-47 (2009)
	2008
61		Bill Jackson, Tibor Jordán: On the rigidity of molecular graphs. Combinatorica 28(6): 645-658 (2008)
60		Bill Jackson, Tibor Jordán: Pin-Collinear Body-and-Pin Frameworks and the Molecular Conjecture. Discrete & Computational Geometry 40(2): 258-278 (2008)
59		Peter J. Cameron, Bill Jackson, Jason D. Rudd: Orbit-counting polynomials for graphs and codes. Discrete Mathematics 308(5-6): 920-930 (2008)
58		Marien Abreu, A. A. Diwan, Bill Jackson, Domenico Labbate, John Sheehan: Pseudo 2-factor isomorphic regular bipartite graphs. J. Comb. Theory, Ser. B 98(2): 432-442 (2008)
	2007
57		Bill Jackson, Tibor Jordán: Rigid Components in Molecular Graphs. Algorithmica 48(4): 399-412 (2007)
56		Bill Jackson: Zero-Free Intervals for Flow Polynomials of Near-Cubic Graphs. Combinatorics, Probability & Computing 16(1): 85-108 (2007)
55		Bill Jackson, Kiyoshi Yoshimoto: Even subgraphs of bridgeless graphs and 2-factors of line graphs. Discrete Mathematics 307(22): 2775-2785 (2007)
54		Bill Jackson, G. Sethuraman, Carol Whitehead: A note on the Erdos-Farber-Lovász conjecture. Discrete Mathematics 307(7-8): 911-915 (2007)
53		Bill Jackson: A zero-free interval for flow polynomials of cubic graphs. J. Comb. Theory, Ser. B 97(1): 127-143 (2007)
52		Bill Jackson, Brigitte Servatius, Herman Servatius: The 2-dimensional rigidity of certain families of graphs. Journal of Graph Theory 54(2): 154-166 (2007)
51		Robert E. L. Aldred, Bill Jackson: Edge proximity conditions for extendability in cubic bipartite graphs. Journal of Graph Theory 55(2): 112-120 (2007)
50		Herbert Fleischner, François Genest, Bill Jackson: Compatible circuit decompositions of 4-regular graphs. Journal of Graph Theory 56(3): 227-240 (2007)
	2006
49		Bill Jackson, Tibor Jordán, Zoltan Szabadka: Globally Linked Pairs of Vertices in Equivalent Realizations of Graphs. Discrete & Computational Geometry 35(3): 493-512 (2006)
48		Bill Jackson, Tibor Jordán: On the Rank Function of the 3-dimensional Rigidity Matroid. Int. J. Comput. Geometry Appl. 16(5-6): 415-430 (2006)
	2005
47		Bill Jackson, Tibor Jordán: Rigid Two-Dimensional Frameworks with Three Collinear Points. Graphs and Combinatorics 21(4): 427-444 (2005)
46		Bill Jackson, Tibor Jordán: Connected rigidity matroids and unique realizations of graphs. J. Comb. Theory, Ser. B 94(1): 1-29 (2005)
45		Bill Jackson, Tibor Jordán: Independence free graphs and vertex connectivity augmentation. J. Comb. Theory, Ser. B 94(1): 31-77 (2005)
44		Bill Jackson, Tibor Jordán: The d-dimensional rigidity matroid of sparse graphs. J. Comb. Theory, Ser. B 95(1): 118-133 (2005)
	2004
43		Robert E. L. Aldred, Martin Funk, Bill Jackson, Domenico Labbate, John Sheehan: Regular bipartite graphs with all 2-factors isomorphic. J. Comb. Theory, Ser. B 92(1): 151-161 (2004)
42		Marien Abreu, Robert E. L. Aldred, Martin Funk, Bill Jackson, Domenico Labbate, John Sheehan: Graphs and digraphs with all 2-factors isomorphic. J. Comb. Theory, Ser. B 92(2): 395-404 (2004)
	2003
41		Alex R. Berg, Bill Jackson, Tibor Jordán: Edge splitting and connectivity augmentation in directed hypergraphs. Discrete Mathematics 273(1-3): 71-84 (2003)
40		Martin Funk, Bill Jackson, Domenico Labbate, John Sheehan: 2-Factor hamiltonian graphs. J. Comb. Theory, Ser. B 87(1): 138-144 (2003)
39		Bill Jackson, Tibor Jordán: Non-separable detachments of graphs. J. Comb. Theory, Ser. B 87(1): 17-37 (2003)
	2001
38		Bill Jackson, Tibor Jordán: Independence Free Graphs and Vertex Connectivity Augmentation. IPCO 2001: 264-279
37		Bill Jackson, Tibor Jordán: Non-Separable Detachments of Graphs. Electronic Notes in Discrete Mathematics 10: 151-153 (2001)
	2000
36		Bill Jackson, Tibor Jordán: A Near Optimal Algorithm for Vertex Connectivity Augmentation. ISAAC 2000: 312-325
35		André Bouchet, Bill Jackson: Parity Systems and the Delta-Matroid Intersection Problem. Electr. J. Comb. 7: (2000)
34		Bill Jackson, Tibor Jordán: Connectivity Augmentation of Graphs. Electronic Notes in Discrete Mathematics 5: 185-188 (2000)
	1999
33		Willem-Jan van den Heuvel, Bill Jackson: On the Edge Connectivity, Hamiltonicity, and Toughness of Vertex-Transitive Graphs. J. Comb. Theory, Ser. B 77(1): 138-149 (1999)
	1998
32		Hugh Edwards, Robert M. Hierons, Bill Jackson: The Zero-Free Intervals for Characteristic Polynomials of Matroids. Combinatorics, Probability & Computing 7(2): 153-165 (1998)
31		Winfried Hochstättler, Bill Jackson: Large Circuits in Binary Matroids of Large Cogirth, I. J. Comb. Theory, Ser. B 74(1): 35-52 (1998)
30		Winfried Hochstättler, Bill Jackson: Large Circuits in Binary Matroids of Large Cogirth, II. J. Comb. Theory, Ser. B 74(1): 53-63 (1998)
29		J. A. Bondy, Bill Jackson: Vertices of Small Degree in Uniquely Hamiltonian Graphs. J. Comb. Theory, Ser. B 74(2): 265-275 (1998)
	1997
28		Bill Jackson, John Sheehan: The structure of transform graphs. Discrete Mathematics 177(1-3): 123-144 (1997)
	1996
27		Bill Jackson, Nicholas C. Wormald: On the linear k-arboricity of cubic graphs. Discrete Mathematics 162(1-3): 293-297 (1996)
26		Lars Døvling Andersen, André Bouchet, Bill Jackson: Orthogonal A-Trails of 4-Regular Graphs Embedded in Surfaces of Low Genus. J. Comb. Theory, Ser. B 66(2): 232-246 (1996)
	1995
25		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, Ser. B 63(2): 163-169 (1995)
24		Jørgen Bang-Jensen, András Frank, Bill Jackson: Preserving and Increasing Local Edge-Connectivity in Mixed Graphs. SIAM J. Discrete Math. 8(2): 155-178 (1995)
	1994
23		Bill Jackson: Shortest Circuit Covers of Cubic Graphs. J. Comb. Theory, Ser. B 60(2): 299-307 (1994)
22		Bill Jackson, Hao Li: Hamilton Cycles in 2-Connected Regular Bipartite Graphs. J. Comb. Theory, Ser. B 62(2): 236-258 (1994)
	1993
21		Bill Jackson: A Zero-Free Interval for Chromatic Polynomials of Graphs. Combinatorics, Probability & Computing 2: 325-336 (1993)
20		Bill Jackson: Hamilton Cycles in Almost-Regular 2-Connected Graphs. J. Comb. Theory, Ser. B 57(1): 77-87 (1993)
	1992
19		Bill Jackson, Hao Li, Yongjin Zhu: Dominating cycles in regular 3-connected graphs. Discrete Mathematics 102(2): 163-176 (1992)
18		Bill Jackson, Nicholas C. Wormald: Longest cycles in 3-connected planar graphs. J. Comb. Theory, Ser. B 54(2): 291-321 (1992)
	1991
17		Robert E. L. Aldred, Derek A. Holton, Bill Jackson: Uniform cyclic edge connectivity in cubic graphs. Combinatorica 11(2): 81-96 (1991)
16		Robert E. L. Aldred, Bill Jackson, Dingjun Lou, Akira Saito: Partitioning regular graphs into equicardinal linear forests. Discrete Mathematics 88(1): 1-9 (1991)
15		Bill Jackson: A characterisation of graphs having three pairwise compatible Euler tours. J. Comb. Theory, Ser. B 53(1): 80-92 (1991)
14		Bill Jackson: Supplementary Eulerian vectors in isotropic systems. J. Comb. Theory, Ser. B 53(1): 93-105 (1991)
	1990
13		Gena Hahn, Bill Jackson: A note concerning paths and independence number in digraphs. Discrete Mathematics 82(3): 327-329 (1990)
12		Bill Jackson, Oscar Ordaz: Chvátal-Erdös conditions for paths and cycles in graphs and digraphs. A survey. Discrete Mathematics 84(3): 241-254 (1990)
11		Bill Jackson: Shortest Circuit Covers and Postman Tours in Graphs with a Nowhere Zero 4-Flow. SIAM J. Comput. 19(4): 659-665 (1990)
	1988
10		Lars Døvling Andersen, Herbert Fleischner, Bill Jackson: Removable edges in cyclically 4-edge-connected cubic graphs. Graphs and Combinatorics 4(1): 1-21 (1988)
	1987
9		Bill Jackson: Compatible Euler tours for transition systems in Eulerian graphs. Discrete Mathematics 66(1-2): 127-131 (1987)
8		Herbert Fleischner, Bill Jackson: Compatible path-cycle-decompositions of plane graphs. J. Comb. Theory, Ser. B 42(1): 94-121 (1987)
7		Bill Jackson: A Chvátal-Erdös condition for hamilton cycles in digraphs. J. Comb. Theory, Ser. B 43(3): 245-252 (1987)
	1986
6		Bill Jackson: Longest cycles in 3-connected cubic graphs. J. Comb. Theory, Ser. B 41(1): 17-26 (1986)
	1985
5		Bill Jackson, Oscar Ordaz: A Chvátal-Erdös condition for (1, 1)-factors in digraphs. Discrete Mathematics 57(1-2): 199-201 (1985)
4		Bill Jackson: Long cycles in bipartite graphs. J. Comb. Theory, Ser. B 38(2): 118-131 (1985)
	1983
3		Jean-Claude Bermond, Bill Jackson, François Jaeger: Shortest coverings of graphs with cycles. J. Comb. Theory, Ser. B 35(3): 297-308 (1983)
	1981
2		Bill Jackson: Cycles in bipartite graphs. J. Comb. Theory, Ser. B 30(3): 332-342 (1981)
	1980
1		Bill Jackson: Hamilton cycles in regular 2-connected graphs. J. Comb. Theory, Ser. B 29(1): 27-46 (1980)

Coauthor Index

1	Marien Abreu	[42] [58] [64]
2	Robert E. L. Aldred	[16] [17] [42] [43] [51] [64]
3	Lars Døvling Andersen	[10] [26]
4	Jørgen Bang-Jensen	[24]
5	Alex R. Berg	[41]
6	Jean-Claude Bermond	[3]
7	Mark Bilinski	[74]
8	J. A. Bondy	[29]
9	André Bouchet	[26] [35]
10	Peter J. Cameron	[59]
11	Ben Cosh	[71]
12	A. A. Diwan	[58]
13	F. M. Dong	[73]
14	Hugh Edwards	[32]
15	Herbert Fleischner	[8] [10] [50]
16	András Frank	[24]
17	Martin Funk	[40] [42] [43] [64]
18	François Genest	[50]
19	Gena Hahn	[13]
20	Willem-Jan van den Heuvel	[33]
21	Robert M. Hierons	[32]
22	Winfried Hochstättler	[30] [31]
23	Derek A. Holton	[17]
24	François Jaeger	[3]
25	Tibor Jordán	[34] [36] [37] [38] [39] [41] [44] [45] [46] [47] [48] [49] [57] [60] [61] [65] [66] [67] [68] [70]
26	Peter Keevash	[75] [76]
27	Zoltán Király	[71]
28	Domenico Labbate	[40] [42] [43] [58] [64]
29	Hao Li	[19] [22]
30	Dingjun Lou	[16]
31	Jie Ma	[74]
32	Oscar Ordaz	[5] [12]
33	Jason D. Rudd	[59]
34	Akira Saito	[16]
35	Brigitte Servatius	[52]
36	Herman Servatius	[52]
37	G. Sethuraman	[54]
38	John Sheehan	[28] [40] [42] [43] [58] [64]
39	Alan D. Sokal	[63] [69]
40	Zoltan Szabadka	[49]
41	Carol Whitehead	[54]
42	Nicholas C. Wormald	[18] [25] [27]
43	Kiyoshi Yoshimoto (Kiyoshi Yoshiomoto)	[55] [62]
44	Xingxing Yu	[74]
45	Yongjin Zhu	[19]

Colors in the list of coauthors

Last update Sat Jun 2 20:57:36 2012 CET by the DBLP Team — Data released under the ODC-BY 1.0 license — See also our legal information page