The SCEAS System
Navigation Menu

Search the dblp DataBase

Title:
Author:

Bill Jackson: [Publications] [Author Rank by year] [Co-authors] [Prefers] [Cites] [Cited by]

Publications of Author

  1. Bill Jackson, Tibor Jordán
    Independence Free Graphs and Vertex Connectivity Augmentation. [Citation Graph (0, 0)][DBLP]
    IPCO, 2001, pp:264-279 [Conf]
  2. Bill Jackson, Tibor Jordán
    A Near Optimal Algorithm for Vertex Connectivity Augmentation. [Citation Graph (0, 0)][DBLP]
    ISAAC, 2000, pp:312-325 [Conf]
  3. Robert E. L. Aldred, Derek A. Holton, Bill Jackson
    Uniform cyclic edge connectivity in cubic graphs. [Citation Graph (0, 0)][DBLP]
    Combinatorica, 1991, v:11, n:2, pp:81-96 [Journal]
  4. André Bouchet, Bill Jackson
    Parity Systems and the Delta-Matroid Intersection Problem. [Citation Graph (0, 0)][DBLP]
    Electr. J. Comb., 2000, v:7, n:, pp:- [Journal]
  5. Hugh Edwards, Robert M. Hierons, Bill Jackson
    The Zero-Free Intervals for Characteristic Polynomials of Matroids. [Citation Graph (0, 0)][DBLP]
    Combinatorics, Probability & Computing, 1998, v:7, n:2, pp:153-165 [Journal]
  6. Bill Jackson
    A Zero-Free Interval for Chromatic Polynomials of Graphs. [Citation Graph (0, 0)][DBLP]
    Combinatorics, Probability & Computing, 1993, v:2, n:, pp:325-336 [Journal]
  7. Bill Jackson, Tibor Jordán, Zoltan Szabadka
    Globally Linked Pairs of Vertices in Equivalent Realizations of Graphs. [Citation Graph (0, 0)][DBLP]
    Discrete & Computational Geometry, 2006, v:35, n:3, pp:493-512 [Journal]
  8. Alex R. Berg, Bill Jackson, Tibor Jordán
    Edge splitting and connectivity augmentation in directed hypergraphs. [Citation Graph (0, 0)][DBLP]
    Discrete Mathematics, 2003, v:273, n:1-3, pp:71-84 [Journal]
  9. Bill Jackson, G. Sethuraman, Carol Whitehead
    A note on the Erdos-Farber-Lovász conjecture. [Citation Graph (0, 0)][DBLP]
    Discrete Mathematics, 2007, v:307, n:7-8, pp:911-915 [Journal]
  10. Bill Jackson, Tibor Jordán
    Rigid Two-Dimensional Frameworks with Three Collinear Points. [Citation Graph (0, 0)][DBLP]
    Graphs and Combinatorics, 2005, v:21, n:4, pp:427-444 [Journal]
  11. Bill Jackson, Tibor Jordán
    On the Rank Function of the 3-dimensional Rigidity Matroid. [Citation Graph (0, 0)][DBLP]
    Int. J. Comput. Geometry Appl., 2006, v:16, n:5-6, pp:415-430 [Journal]
  12. Martin Abreu, Robert E. L. Aldred, Martin Funk, Bill Jackson, Domenico Labbate, John Sheehan
    Graphs and digraphs with all 2-factors isomorphic. [Citation Graph (0, 0)][DBLP]
    J. Comb. Theory, Ser. B, 2004, v:92, n:2, pp:395-404 [Journal]
  13. Lars Døvling Andersen, André Bouchet, Bill Jackson
    Orthogonal A-Trails of 4-Regular Graphs Embedded in Surfaces of Low Genus. [Citation Graph (0, 0)][DBLP]
    J. Comb. Theory, Ser. B, 1996, v:66, n:2, pp:232-246 [Journal]
  14. Robert E. L. Aldred, Martin Funk, Bill Jackson, Domenico Labbate, John Sheehan
    Regular bipartite graphs with all 2-factors isomorphic. [Citation Graph (0, 0)][DBLP]
    J. Comb. Theory, Ser. B, 2004, v:92, n:1, pp:151-161 [Journal]
  15. Jean-Claude Bermond, Bill Jackson, François Jaeger
    Shortest coverings of graphs with cycles. [Citation Graph (0, 0)][DBLP]
    J. Comb. Theory, Ser. B, 1983, v:35, n:3, pp:297-308 [Journal]
  16. J. A. Bondy, Bill Jackson
    Vertices of Small Degree in Uniquely Hamiltonian Graphs. [Citation Graph (0, 0)][DBLP]
    J. Comb. Theory, Ser. B, 1998, v:74, n:2, pp:265-275 [Journal]
  17. Herbert Fleischner, Bill Jackson
    Compatible path-cycle-decompositions of plane graphs. [Citation Graph (0, 0)][DBLP]
    J. Comb. Theory, Ser. B, 1987, v:42, n:1, pp:94-121 [Journal]
  18. Martin Funk, Bill Jackson, Domenico Labbate, John Sheehan
    2-Factor hamiltonian graphs. [Citation Graph (0, 0)][DBLP]
    J. Comb. Theory, Ser. B, 2003, v:87, n:1, pp:138-144 [Journal]
  19. Winfried Hochstättler, Bill Jackson
    Large Circuits in Binary Matroids of Large Cogirth, I. [Citation Graph (0, 0)][DBLP]
    J. Comb. Theory, Ser. B, 1998, v:74, n:1, pp:35-52 [Journal]
  20. Winfried Hochstättler, Bill Jackson
    Large Circuits in Binary Matroids of Large Cogirth, II. [Citation Graph (0, 0)][DBLP]
    J. Comb. Theory, Ser. B, 1998, v:74, n:1, pp:53-63 [Journal]
  21. Willem-Jan van den Heuvel, Bill Jackson
    On the Edge Connectivity, Hamiltonicity, and Toughness of Vertex-Transitive Graphs. [Citation Graph (0, 0)][DBLP]
    J. Comb. Theory, Ser. B, 1999, v:77, n:1, pp:138-149 [Journal]
  22. Bill Jackson
    Long cycles in bipartite graphs. [Citation Graph (0, 0)][DBLP]
    J. Comb. Theory, Ser. B, 1985, v:38, n:2, pp:118-131 [Journal]
  23. Bill Jackson
    Longest cycles in 3-connected cubic graphs. [Citation Graph (0, 0)][DBLP]
    J. Comb. Theory, Ser. B, 1986, v:41, n:1, pp:17-26 [Journal]
  24. Bill Jackson
    A Chvátal-Erdös condition for hamilton cycles in digraphs. [Citation Graph (0, 0)][DBLP]
    J. Comb. Theory, Ser. B, 1987, v:43, n:3, pp:245-252 [Journal]
  25. Bill Jackson
    A characterisation of graphs having three pairwise compatible Euler tours. [Citation Graph (0, 0)][DBLP]
    J. Comb. Theory, Ser. B, 1991, v:53, n:1, pp:80-92 [Journal]
  26. Bill Jackson
    Supplementary Eulerian vectors in isotropic systems. [Citation Graph (0, 0)][DBLP]
    J. Comb. Theory, Ser. B, 1991, v:53, n:1, pp:93-105 [Journal]
  27. Bill Jackson
    Hamilton Cycles in Almost-Regular 2-Connected Graphs. [Citation Graph (0, 0)][DBLP]
    J. Comb. Theory, Ser. B, 1993, v:57, n:1, pp:77-87 [Journal]
  28. Bill Jackson
    Shortest Circuit Covers of Cubic Graphs. [Citation Graph (0, 0)][DBLP]
    J. Comb. Theory, Ser. B, 1994, v:60, n:2, pp:299-307 [Journal]
  29. Bill Jackson, Tibor Jordán
    Non-separable detachments of graphs. [Citation Graph (0, 0)][DBLP]
    J. Comb. Theory, Ser. B, 2003, v:87, n:1, pp:17-37 [Journal]
  30. Bill Jackson, Tibor Jordán
    Connected rigidity matroids and unique realizations of graphs. [Citation Graph (0, 0)][DBLP]
    J. Comb. Theory, Ser. B, 2005, v:94, n:1, pp:1-29 [Journal]
  31. Bill Jackson, Tibor Jordán
    Independence free graphs and vertex connectivity augmentation. [Citation Graph (0, 0)][DBLP]
    J. Comb. Theory, Ser. B, 2005, v:94, n:1, pp:31-77 [Journal]
  32. Bill Jackson, Tibor Jordán
    The d-dimensional rigidity matroid of sparse graphs. [Citation Graph (0, 0)][DBLP]
    J. Comb. Theory, Ser. B, 2005, v:95, n:1, pp:118-133 [Journal]
  33. Bill Jackson, Hao Li
    Hamilton Cycles in 2-Connected Regular Bipartite Graphs. [Citation Graph (0, 0)][DBLP]
    J. Comb. Theory, Ser. B, 1994, v:62, n:2, pp:236-258 [Journal]
  34. Bill Jackson, Nicholas C. Wormald
    Longest cycles in 3-connected planar graphs. [Citation Graph (0, 0)][DBLP]
    J. Comb. Theory, Ser. B, 1992, v:54, n:2, pp:291-321 [Journal]
  35. Bill Jackson, Nicholas C. Wormald
    Long Cycles and 3-Connected Spanning Subgraphs of Bounded Degree in 3-Connected K1, d-Free Graphs. [Citation Graph (0, 0)][DBLP]
    J. Comb. Theory, Ser. B, 1995, v:63, n:2, pp:163-169 [Journal]
  36. Bill Jackson
    A zero-free interval for flow polynomials of cubic graphs. [Citation Graph (0, 0)][DBLP]
    J. Comb. Theory, Ser. B, 2007, v:97, n:1, pp:127-143 [Journal]
  37. Bill Jackson
    Cycles in bipartite graphs. [Citation Graph (0, 0)][DBLP]
    J. Comb. Theory, Ser. B, 1981, v:30, n:3, pp:332-342 [Journal]
  38. Bill Jackson
    Hamilton cycles in regular 2-connected graphs. [Citation Graph (0, 0)][DBLP]
    J. Comb. Theory, Ser. B, 1980, v:29, n:1, pp:27-46 [Journal]
  39. Bill Jackson
    Shortest Circuit Covers and Postman Tours in Graphs with a Nowhere Zero 4-Flow. [Citation Graph (0, 0)][DBLP]
    SIAM J. Comput., 1990, v:19, n:4, pp:659-665 [Journal]
  40. Jørgen Bang-Jensen, András Frank, Bill Jackson
    Preserving and Increasing Local Edge-Connectivity in Mixed Graphs. [Citation Graph (0, 0)][DBLP]
    SIAM J. Discrete Math., 1995, v:8, n:2, pp:155-178 [Journal]
  41. Bill Jackson, Brigitte Servatius, Herman Servatius
    The 2-dimensional rigidity of certain families of graphs. [Citation Graph (0, 0)][DBLP]
    Journal of Graph Theory, 2007, v:54, n:2, pp:154-166 [Journal]
  42. Bill Jackson, Tibor Jordán
    Rigid Components in Molecular Graphs. [Citation Graph (0, 0)][DBLP]
    Algorithmica, 2007, v:48, n:4, pp:399-412 [Journal]
  43. Bill Jackson, Oscar Ordaz
    A Chvátal-Erdös condition for (1, 1)-factors in digraphs. [Citation Graph (0, 0)][DBLP]
    Discrete Mathematics, 1985, v:57, n:1-2, pp:199-201 [Journal]
  44. Bill Jackson
    Compatible Euler tours for transition systems in Eulerian graphs. [Citation Graph (0, 0)][DBLP]
    Discrete Mathematics, 1987, v:66, n:1-2, pp:127-131 [Journal]
  45. Bill Jackson, John Sheehan
    The structure of transform graphs. [Citation Graph (0, 0)][DBLP]
    Discrete Mathematics, 1997, v:177, n:1-3, pp:123-144 [Journal]
  46. Bill Jackson, Nicholas C. Wormald
    On the linear k-arboricity of cubic graphs. [Citation Graph (0, 0)][DBLP]
    Discrete Mathematics, 1996, v:162, n:1-3, pp:293-297 [Journal]
  47. Gena Hahn, Bill Jackson
    A note concerning paths and independence number in digraphs. [Citation Graph (0, 0)][DBLP]
    Discrete Mathematics, 1990, v:82, n:3, pp:327-329 [Journal]
  48. Bill Jackson, Oscar Ordaz
    Chvátal-Erdös conditions for paths and cycles in graphs and digraphs. A survey. [Citation Graph (0, 0)][DBLP]
    Discrete Mathematics, 1990, v:84, n:3, pp:241-254 [Journal]
  49. Robert E. L. Aldred, Bill Jackson, Dingjun Lou, Akira Saito
    Partitioning regular graphs into equicardinal linear forests. [Citation Graph (0, 0)][DBLP]
    Discrete Mathematics, 1991, v:88, n:1, pp:1-9 [Journal]
  50. Bill Jackson, Hao Li, Yongjin Zhu
    Dominating cycles in regular 3-connected graphs. [Citation Graph (0, 0)][DBLP]
    Discrete Mathematics, 1992, v:102, n:2, pp:163-176 [Journal]

  51. On the rigidity of molecular graphs. [Citation Graph (, )][DBLP]


  52. Zero-Free Intervals for Flow Polynomials of Near-Cubic Graphs. [Citation Graph (, )][DBLP]


  53. A sufficient connectivity condition for generic rigidity in the plane. [Citation Graph (, )][DBLP]


  54. Local edge-connectivity augmentation in hypergraphs is NP-complete. [Citation Graph (, )][DBLP]


  55. Pin-Collinear Body-and-Pin Frameworks and the Molecular Conjecture. [Citation Graph (, )][DBLP]


  56. Even subgraphs of bridgeless graphs and 2-factors of line graphs. [Citation Graph (, )][DBLP]


  57. Orbit-counting polynomials for graphs and codes. [Citation Graph (, )][DBLP]


  58. Brick partitions of graphs. [Citation Graph (, )][DBLP]


  59. The generic rank of body-bar-and-hinge frameworks. [Citation Graph (, )][DBLP]


Search in 0.030secs, Finished in 0.033secs
NOTICE1
System may not be available sometimes or not working properly, since it is still in development with continuous upgrades
NOTICE2
The rankings that are presented on this page should NOT be considered as formal since the citation info is incomplete in DBLP
 
System created by asidirop@csd.auth.gr [http://users.auth.gr/~asidirop/] © 2002
for Data Engineering Laboratory, Department of Informatics, Aristotle University © 2002