Bill Jackson

From MaRDI portal
Person:273170

Available identifiers

zbMath Open jackson.billMaRDI QIDQ273170

List of research outcomes

PublicationDate of PublicationType
Maximal matroids in weak order posets2024-01-15Paper
Corrigendum to ‘flexible circuits in the d $d$‐dimensional rigidity matroid’2023-10-12Paper
Edge proximity conditions for extendability in regular bipartite graphs2023-10-09Paper
Flexible circuits in the d‐dimensional rigidity matroid2023-10-05Paper
A necessary condition for generic rigidity of bar‐and‐joint frameworks in d‐space2023-10-04Paper
Zeros of the Tutte polynomial2023-04-28Paper
Rigidity of Symmetric Simplicial Complexes and the Lower Bound Theorem2023-04-10Paper
Vertex splitting, coincident realisations, and global rigidity of braced triangulations2023-01-23Paper
Abstract 3-Rigidity and Bivariate $C_2^1$-Splines II: Combinatorial Characterization2023-01-18Paper
[https://portal.mardi4nfdi.de/wiki/Publication:5871272 Abstract 3-Rigidity and Bivariate $C_2^1$-Splines I: Whiteley's Maximality Conjecture]2023-01-18Paper
Coincident rigidity of 2-dimensional frameworks2022-08-02Paper
Global Rigidity of 2D Linearly Constrained Frameworks2022-01-18Paper
An Improved Bound for the Rigidity of Linearly Constrained Frameworks2021-05-28Paper
Global rigidity of direction-length frameworks2020-09-24Paper
Rigidity of Linearly Constrained Frameworks2020-08-17Paper
Vertex Splitting, Coincident Realisations and Global Rigidity of Braced Triangulations2020-02-20Paper
Global rigidity of generic frameworks on the cylinder2019-11-21Paper
Abstract 3-Rigidity and Bivariate $C_2^1$-Splines I: Whiteley's Maximality Conjecture2019-11-01Paper
Radically solvable graphs2019-06-17Paper
Rigid cylindrical frameworks with two coincident points2019-03-21Paper
Equivalent realisations of a rigid graph2019-02-21Paper
Point-hyperplane frameworks, slider joints, and rigidity preserving transformations2019-02-08Paper
https://portal.mardi4nfdi.de/entity/Q45560592018-11-23Paper
https://portal.mardi4nfdi.de/entity/Q45560602018-11-23Paper
Antistrong digraphs2016-11-25Paper
Unique low rank completability of partially filled matrices2016-10-12Paper
https://portal.mardi4nfdi.de/entity/Q28225902016-09-30Paper
https://portal.mardi4nfdi.de/entity/Q28161062016-07-01Paper
A characterisation of the generic rigidity of 2-dimensional point-line frameworks2016-04-21Paper
Henneberg moves on mechanisms2015-10-16Paper
Stress matrices and global rigidity of frameworks on surfaces2015-10-14Paper
Globally Linked Pairs of Vertices in Rigid Frameworks2015-07-08Paper
Combinatorial Conditions for the Unique Completability of Low-Rank Matrices2015-04-17Paper
Graded sparse graphs and body-length-direction frameworks2015-02-18Paper
Necessary conditions for the generic global rigidity of frameworks on surfaces2014-10-29Paper
Counting 2-connected deletion-minors of binary matroids2013-12-02Paper
Strongly rigid tensegrity graphs on the line2013-04-25Paper
Complex zero-free regions at large \(|q|\) for multivariate Tutte polynomials (alias Potts-model partition functions) with general complex edge weights2013-01-18Paper
Boundedness, rigidity and global rigidity of direction-length frameworks2012-04-12Paper
A Zero-Free Interval for Chromatic Polynomials of Nearly 3-Connected Plane Graphs2012-03-15Paper
Bounded direction-length frameworks2011-06-10Paper
Necessary conditions for the global rigidity of direction-length frameworks2011-06-10Paper
Circumference of 3-connected claw-free graphs and large Eulerian subgraphs of 3-edge-connected graphs2011-05-19Paper
An inequality for Tutte polynomials2011-04-26Paper
OPERATIONS PRESERVING GLOBAL RIGIDITY OF GENERIC DIRECTION-LENGTH FRAMEWORKS2011-02-02Paper
Maxmaxflow and counting subgraphs2010-08-12Paper
Local edge-connectivity augmentation in hypergraphs is NP-complete2010-05-05Paper
Globally rigid circuits of the direction-length rigidity matroid2010-05-05Paper
The generic rank of body-bar-and-hinge frameworks2010-04-27Paper
Brick partitions of graphs2010-03-29Paper
On the rigidity of molecular graphs2009-12-28Paper
Spanning even subgraphs of 3‐edge‐connected graphs2009-12-18Paper
Zero-free regions for multivariate tutte polynomials (alias Potts-model partition functions) of graphs and matroids2009-12-11Paper
A sufficient connectivity condition for generic rigidity in the plane2009-06-24Paper
Corrigendum to ``Graphs and digraphs with all 2-factors isomorphic [J. Combin. Theory Ser. B 92 (2) (2004) 395-404]2009-01-21Paper
Pin-collinear body-and-pin frameworks and the molecular conjecture2008-12-02Paper
Pseudo 2-factor isomorphic regular bipartite graphs2008-03-14Paper
Orbit-counting polynomials for graphs and codes2008-02-14Paper
Compatible circuit decompositions of 4‐regular graphs2008-01-04Paper
Even subgraphs of bridgeless graphs and 2-factors of line graphs2007-11-27Paper
Rigid components in molecular graphs2007-09-10Paper
Edge proximity conditions for extendability in cubic bipartite graphs2007-06-11Paper
Non-Separable Detachments of Graphs2007-05-29Paper
Zero-Free Intervals for Flow Polynomials of Near-Cubic Graphs2007-03-20Paper
A note on the Erdős--Farber--Lovász conjecture2007-03-02Paper
The 2-dimensional rigidity of certain families of graphs2007-02-09Paper
ON THE RANK FUNCTION OF THE 3-DIMENSIONAL RIGIDITY MATROID2007-02-09Paper
A zero-free interval for flow polynomials of cubic graphs2007-01-11Paper
Rigid two-dimensional frameworks with three collinear points2006-06-16Paper
Globally linked pairs of vertices in equivalent realizations of graphs2006-06-14Paper
The Dress conjectures on rank in the 3-dimensional rigidity matroid2006-04-28Paper
The \(d\)-dimensional rigidity matroid of sparse graphs2005-09-28Paper
Connected rigidity matroids and unique realizations of graphs2005-05-04Paper
Independence free graphs and vertex connectivity augmentation2005-05-04Paper
Graphs and digraphs with all 2-factors isomorphic2005-02-16Paper
Regular bipartite graphs with all 2-factors isomorphic2004-10-01Paper
https://portal.mardi4nfdi.de/entity/Q44725042004-08-04Paper
Edge splitting and connectivity augmentation in directed hypergraphs.2004-01-05Paper
Det‐extremal cubic bipartite graphs2003-11-10Paper
Zeros of chromatic and flow polynomials of graphs2003-08-31Paper
Non-separable detachments of graphs2003-08-20Paper
2-factor Hamiltonian graphs.2003-08-20Paper
Highly edge-connected detachments of graphs and digraphs2003-05-22Paper
Hamilton cycles in plane triangulations2003-03-19Paper
https://portal.mardi4nfdi.de/entity/Q45377492002-06-20Paper
Vertices of small degree in uniquely Hamiltonian graphs2000-06-25Paper
On the edge connectivity, Hamiltonicity, and toughness of vertex-transitive graphs2000-06-25Paper
Removable Circuits in Binary Matroids2000-06-04Paper
Parity systems and the delta-matroid intersection problem2000-03-12Paper
Augmenting hypergraphs by edges of size two1999-11-23Paper
The Zero-Free Intervals for Characteristic Polynomials of Matroids1999-08-23Paper
Some remarks on Jaeger's dual-hamiltonian conjecture1999-07-12Paper
Large circuits in binary matroids of large cogirth. II1999-06-08Paper
The structure of transform graphs1999-03-08Paper
Large circuits in binary matroids of large cogirth. I1998-12-14Paper
On the linear \(k\)-arboricity of cubic graphs1997-06-10Paper
https://portal.mardi4nfdi.de/entity/Q48881041997-06-09Paper
Orthogonal A-trails of 4-regular graphs embedded in surfaces of low genus1997-01-12Paper
Preserving and Increasing Local Edge-Connectivity in Mixed Graphs1996-04-08Paper
Long cycles and 3-connected spanning subgraphs of bounded degree in 3- connected \(K_{1,d}\)-free graphs1995-07-02Paper
https://portal.mardi4nfdi.de/entity/Q43261971995-06-13Paper
Cycles through vertices of large maximum degree1995-03-20Paper
Hamilton cycles in 2-connected regular bipartite graphs1995-03-02Paper
Shortest circuit covers of cubic graphs1995-01-26Paper
A Zero-Free Interval for Chromatic Polynomials of Graphs1994-08-28Paper
https://portal.mardi4nfdi.de/entity/Q31424151994-06-28Paper
https://portal.mardi4nfdi.de/entity/Q31369941993-11-01Paper
Hamilton cycles in almost-regular 2-connected graphs1993-01-01Paper
https://portal.mardi4nfdi.de/entity/Q40146271992-10-18Paper
https://portal.mardi4nfdi.de/entity/Q40141921992-10-12Paper
Dominating cycles in regular 3-connected graphs1992-09-27Paper
Uniform cyclic edge connectivity in cubic graphs1992-06-27Paper
Neighborhood unions and hamilton cycles1992-06-26Paper
https://portal.mardi4nfdi.de/entity/Q39720981992-06-25Paper
Partitioning regular graphs into equicardinal linear forests1992-06-25Paper
Longest cycles in 3-connected planar graphs1992-01-01Paper
A characterisation of graphs having three pariwise compatible Euler tours1991-01-01Paper
Supplementary Eulerian vectors in isotropic systems1991-01-01Paper
Shortest Circuit Covers and Postman Tours in Graphs with a Nowhere Zero 41990-01-01Paper
On the maximum number of pairwise compatible euler cycles1990-01-01Paper
Cycles containing matchings and pairwise compatible euler tours1990-01-01Paper
A note concerning paths and independence number in digraphs1990-01-01Paper
Chvátal-Erdős conditions for paths and cycles in graphs and digraphs. A survey1990-01-01Paper
Removable edges in 3-connected graphs1990-01-01Paper
https://portal.mardi4nfdi.de/entity/Q38326071989-01-01Paper
A note concerning graphs with unique f-factors1989-01-01Paper
Some remarks on Arc‐connectivity, vertex splitting, and orientation in graphs and digraphs1988-01-01Paper
https://portal.mardi4nfdi.de/entity/Q38000631988-01-01Paper
Removable edges in cyclically 4-edge-connected cubic graphs1988-01-01Paper
Edge-colouring random graphs1988-01-01Paper
A note concerning the chromatic index of multigraphs1987-01-01Paper
Compatible Euler tours for transition systems in Eulerian graphs1987-01-01Paper
Compatible path-cycle-decompositions of plane graphs1987-01-01Paper
A Chvátal-Erdős condition for Hamilton cycles in digraphs1987-01-01Paper
Large holes in sparse random graphs1987-01-01Paper
Large induced trees in sparse random graphs1987-01-01Paper
https://portal.mardi4nfdi.de/entity/Q36841491986-01-01Paper
Longest cycles in 3-connected cubic graphs1986-01-01Paper
https://portal.mardi4nfdi.de/entity/Q36917701985-01-01Paper
Removable Cycles in Planar Graphs1985-01-01Paper
https://portal.mardi4nfdi.de/entity/Q37039211985-01-01Paper
Toughness and the existence ofk-factors1985-01-01Paper
Long cycles in bipartite graphs1985-01-01Paper
A Chvátal-Erdős condition for (1,1)-factors in digraphs1985-01-01Paper
https://portal.mardi4nfdi.de/entity/Q33426071985-01-01Paper
https://portal.mardi4nfdi.de/entity/Q51873171984-01-01Paper
Shortest coverings of graphs with cycles1983-01-01Paper
Maximal Cycles in Bipartite Graphs1983-01-01Paper
Long paths and cycles in oriented graphs1981-01-01Paper
Cycles in bipartite graphs1981-01-01Paper
Removable Cycles in 2-Connected Graphs of Minimum Degree at Least Four1980-01-01Paper
Paths and Cycles in Oriented Graphs1980-01-01Paper
Hamilton cycles in regular 2-connected graphs1980-01-01Paper
https://portal.mardi4nfdi.de/entity/Q39128301979-01-01Paper
Edge-Disjoint Hamilton Cycles in Regular Graphs of Large Degree1979-01-01Paper
https://portal.mardi4nfdi.de/entity/Q41949891978-01-01Paper
Hamilton cycles in regular graphs1978-01-01Paper

Research outcomes over time


Doctoral students

No records found.


Known relations from the MaRDI Knowledge Graph

PropertyValue
MaRDI profile typeMaRDI person profile
instance ofhuman


This page was built for person: Bill Jackson