Bill Jackson

,

J. Comb. Theory B, March, 2024

Edge proximity conditions for extendability in regular bipartite graphs.

[BibT_eX]

[DOI]

Robert E. L. Aldred

,

,

Michael D. Plummer

J. Graph Theory, October, 2023

Vertex Splitting, Coincident Realisations, and Global Rigidity of Braced Triangulations.

[BibT_eX]

[DOI]

James Cruickshank

,

,

Discret. Comput. Geom., 2023

A necessary condition for generic rigidity of bar-and-joint frameworks in d-space.

[BibT_eX]

[DOI]

Hakan Guler

,

J. Graph Theory, 2022

Flexible circuits in the d-dimensional rigidity matroid.

[BibT_eX]

[DOI]

,

,

,

J. Graph Theory, 2022

Coincident Rigidity of 2-Dimensional Frameworks.

[BibT_eX]

[DOI]

Hakan Guler

,

Graphs Comb., 2022

An Improved Bound for the Rigidity of Linearly Constrained Frameworks.

[BibT_eX]

[DOI]

,

,

SIAM J. Discret. Math., 2021

Global rigidity of direction-length frameworks.

[BibT_eX]

[DOI]

Katie Clinch

,

,

Peter Keevash

J. Comb. Theory B, 2020

Radically solvable graphs.

[BibT_eX]

[DOI]

,

J. C. Owen

J. Comb. Theory B, 2019

Global rigidity of generic frameworks on the cylinder.

[BibT_eX]

[DOI]

,

J. Comb. Theory B, 2019

Point-hyperplane frameworks, slider joints, and rigidity preserving transformations.

[BibT_eX]

[DOI]

,

,

,

,

,

J. Comb. Theory B, 2019

Rigid Cylindrical Frameworks with Two Coincident Points.

[BibT_eX]

[DOI]

,

Viktória E. Kaszanitzky

,

Graphs Comb., 2019

Equivalent realisations of a rigid graph.

[BibT_eX]

[DOI]

,

J. C. Owen

Discret. Appl. Math., 2019

Antistrong digraphs.

[BibT_eX]

[DOI]

,

,

,

J. Comb. Theory B, 2017

A characterisation of the generic rigidity of 2-dimensional point-line frameworks.

[BibT_eX]

[DOI]

,

J. C. Owen

J. Comb. Theory B, 2016

Unique low rank completability of partially filled matrices.

[BibT_eX]

[DOI]

,

,

J. Comb. Theory B, 2016

Graded sparse graphs and body-length-direction frameworks.

[BibT_eX]

[DOI]

,

Viet Hang Nguyen

Eur. J. Comb., 2015

Stress Matrices and Global Rigidity of Frameworks on Surfaces.

[BibT_eX]

[DOI]

,

Discret. Comput. Geom., 2015

Combinatorial Conditions for the Unique Completability of Low-Rank Matrices.

[BibT_eX]

[DOI]

,

,

SIAM J. Discret. Math., 2014

Necessary Conditions for the Generic Global Rigidity of Frameworks on Surfaces.

[BibT_eX]

[DOI]

,

Thomas A. McCourt

,

Discret. Comput. Geom., 2014

Complex zero-free regions at large |q| for multivariate Tutte polynomials (alias Potts-model partition functions) with general complex edge weights.

[BibT_eX]

[DOI]

,

Aldo Procacci

,

Alan D. Sokal

J. Comb. Theory B, 2013

Counting 2-connected deletion-minors of binary matroids.

[BibT_eX]

[DOI]

Discret. Math., 2013

Strongly rigid tensegrity graphs on the line.

[BibT_eX]

[DOI]

,

,

Csaba Király

Discret. Appl. Math., 2013

A Zero-Free Interval for Chromatic Polynomials of Nearly 3-Connected Plane Graphs.

[BibT_eX]

[DOI]

Feng Ming Dong

,

SIAM J. Discret. Math., 2011

Circumference of 3-connected claw-free graphs and large Eulerian subgraphs of 3-edge-connected graphs.

[BibT_eX]

[DOI]

,

,

,

J. Comb. Theory B, 2011

Necessary Conditions for the Global Rigidity of Direction-Length Frameworks.

[BibT_eX]

[DOI]

,

Peter Keevash

Discret. Comput. Geom., 2011

Bounded Direction-Length Frameworks.

[BibT_eX]

[DOI]

,

Peter Keevash

Discret. Comput. Geom., 2011

Globally rigid circuits of the direction-length rigidity matroid.

[BibT_eX]

[DOI]

,

J. Comb. Theory B, 2010

Operations Preserving Global Rigidity of Generic Direction-Length Frameworks.

[BibT_eX]

[DOI]

,

Int. J. Comput. Geom. Appl., 2010

The generic rank of body-bar-and-hinge frameworks.

[BibT_eX]

[DOI]

,

Eur. J. Comb., 2010

Brick partitions of graphs.

[BibT_eX]

[DOI]

,

Discret. Math., 2010

Local edge-connectivity augmentation in hypergraphs is NP-complete.

[BibT_eX]

[DOI]

Zoltán Király

,

Ben Cosh

,

Discret. Appl. Math., 2010

Maxmaxflow and Counting Subgraphs.

[BibT_eX]

[DOI]

,

Alan D. Sokal

Electron. J. Comb., 2010

An inequality for Tutte polynomials.

[BibT_eX]

[DOI]

Comb., 2010

Spanning even subgraphs of 3-edge-connected graphs.

[BibT_eX]

[DOI]

,

Kiyoshi Yoshimoto

J. Graph Theory, 2009

Zero-free regions for multivariate Tutte polynomials (alias Potts-model partition functions) of graphs and matroids.

[BibT_eX]

[DOI]

,

Alan D. Sokal

J. Comb. Theory B, 2009

Corrigendum to "Graphs and digraphs with all 2-factors isomorphic" [J. Combin. Theory Ser. B 92 (2) (2004) 395-404].

[BibT_eX]

[DOI]

,

,

,

,

,

J. Comb. Theory B, 2009

A sufficient connectivity condition for generic rigidity in the plane.

[BibT_eX]

[DOI]

,

Discret. Appl. Math., 2009

Pseudo 2-factor isomorphic regular bipartite graphs.

[BibT_eX]

[DOI]

,

,

,

,

J. Comb. Theory B, 2008

Orbit-counting polynomials for graphs and codes.

[BibT_eX]

[DOI]

Peter J. Cameron

,

,

Jason D. Rudd

Discret. Math., 2008

Pin-Collinear Body-and-Pin Frameworks and the Molecular Conjecture.

[BibT_eX]

[DOI]

,

Discret. Comput. Geom., 2008

On the rigidity of molecular graphs.

[BibT_eX]

[DOI]

,

Comb., 2008

The 2-dimensional rigidity of certain families of graphs.

[BibT_eX]

[DOI]

,

Brigitte Servatius

,

Herman Servatius

J. Graph Theory, 2007

Compatible circuit decompositions of 4-regular graphs.

[BibT_eX]

[DOI]

,

François Genest

,

J. Graph Theory, 2007

Edge proximity conditions for extendability in cubic bipartite graphs.

[BibT_eX]

[DOI]

Robert E. L. Aldred

,

J. Graph Theory, 2007

A zero-free interval for flow polynomials of cubic graphs.

[BibT_eX]

[DOI]

J. Comb. Theory B, 2007

Even subgraphs of bridgeless graphs and 2-factors of line graphs.

[BibT_eX]

[DOI]

,

Kiyoshi Yoshimoto

Discret. Math., 2007

A note on the Erdos-Farber-Lovász conjecture.

[BibT_eX]

[DOI]

,

G. Sethuraman

,

Carol A. Whitehead

Discret. Math., 2007

Zero-Free Intervals for Flow Polynomials of Near-Cubic Graphs.

[BibT_eX]

[DOI]

Comb. Probab. Comput., 2007

Rigid Components in Molecular Graphs.

[BibT_eX]

[DOI]

,

Algorithmica, 2007

On the Rank Function of the 3-dimensional Rigidity Matroid.

[BibT_eX]

[DOI]

,

Int. J. Comput. Geom. Appl., 2006

Globally Linked Pairs of Vertices in Equivalent Realizations of Graphs.

[BibT_eX]

[DOI]

,

,

Zoltan Szabadka

Discret. Comput. Geom., 2006

The d-dimensional rigidity matroid of sparse graphs.

[BibT_eX]

[DOI]

,

J. Comb. Theory B, 2005

Independence free graphs and vertex connectivity augmentation.

[BibT_eX]

[DOI]

,

J. Comb. Theory B, 2005

Connected rigidity matroids and unique realizations of graphs.

[BibT_eX]

[DOI]

,

J. Comb. Theory B, 2005

Rigid Two-Dimensional Frameworks with Three Collinear Points.

[BibT_eX]

[DOI]

,

Graphs Comb., 2005

The Dress conjectures on rank in the 3-dimensional rigidity matroid.

[BibT_eX]

[DOI]

,

Adv. Appl. Math., 2005

Regular bipartite graphs with all 2-factors isomorphic.

[BibT_eX]

[DOI]

,

,

,

,

J. Comb. Theory B, 2004

Graphs and digraphs with all 2-factors isomorphic.

[BibT_eX]

[DOI]

,

,

,

,

,

J. Comb. Theory B, 2004

Det-extremal cubic bipartite graphs.

[BibT_eX]

[DOI]

,

,

,

J. Graph Theory, 2003

Highly edge-connected detachments of graphs and digraphs.

[BibT_eX]

[DOI]

Alex R. Berg

,

,

J. Graph Theory, 2003

Non-separable detachments of graphs.

[BibT_eX]

[DOI]

,

J. Comb. Theory B, 2003

2-Factor hamiltonian graphs.

[BibT_eX]

[DOI]

,

,

,

J. Comb. Theory B, 2003

Edge splitting and connectivity augmentation in directed hypergraphs.

[BibT_eX]

[DOI]

Alex R. Berg

,

,

Discret. Math., 2003

Hamilton cycles in plane triangulations.

[BibT_eX]

[DOI]

,

Xingxing Yu

J. Graph Theory, 2002

Connectivity Augmentation of Graphs.

[BibT_eX]

[DOI]

,

Electron. Notes Discret. Math., 2000

Parity Systems and the Delta-Matroid Intersection Problem.

[BibT_eX]

[DOI]

André Bouchet

,

Electron. J. Comb., 2000

Augmenting hypergraphs by edges of size two.

[BibT_eX]

[DOI]

Jørgen Bang-Jensen

,

Math. Program., 1999

On the Edge Connectivity, Hamiltonicity, and Toughness of Vertex-Transitive Graphs.

[BibT_eX]

[DOI]

Jan van den Heuvel

,

J. Comb. Theory B, 1999

Large Circuits in Binary Matroids of Large Cogirth, II.

[BibT_eX]

[DOI]

Winfried Hochstättler

,

J. Comb. Theory B, 1998

Large Circuits in Binary Matroids of Large Cogirth, I.

[BibT_eX]

[DOI]

Winfried Hochstättler

,

J. Comb. Theory B, 1998

Vertices of Small Degree in Uniquely Hamiltonian Graphs.

[BibT_eX]

[DOI]

J. Adrian Bondy

,

J. Comb. Theory B, 1998

The Zero-Free Intervals for Characteristic Polynomials of Matroids.

[BibT_eX]

[DOI]

Hugh Edwards

,

Robert M. Hierons

,

Comb. Probab. Comput., 1998

The structure of transform graphs.

[BibT_eX]

[DOI]

,

John Sheehan

Discret. Math., 1997

Hamiltonicity of regular 2-connected graphs.

[BibT_eX]

[DOI]

,

,

,

J. Graph Theory, 1996

Orthogonal A-Trails of 4-Regular Graphs Embedded in Surfaces of Low Genus.

[BibT_eX]

[DOI]

Lars Døvling Andersen

,

André Bouchet

,

J. Comb. Theory B, 1996

On the linear k-arboricity of cubic graphs.

[BibT_eX]

[DOI]

,

Discret. Math., 1996

Preserving and Increasing Local Edge-Connectivity in Mixed Graphs.

[BibT_eX]

[DOI]

Jørgen Bang-Jensen

,

András Frank

,

SIAM J. Discret. Math., 1995

Cycles through vertices of large maximum degree.

[BibT_eX]

[DOI]

J. Graph Theory, 1995

Long Cycles and 3-Connected Spanning Subgraphs of Bounded Degree in 3-Connected K1, d-Free Graphs.

[BibT_eX]

[DOI]

,

J. Comb. Theory B, 1995

Hamilton Cycles in 2-Connected Regular Bipartite Graphs.

[BibT_eX]

[DOI]

,

Hao Li

J. Comb. Theory B, 1994

Shortest Circuit Covers of Cubic Graphs.

[BibT_eX]

[DOI]

J. Comb. Theory B, 1994

Hamilton Cycles in Almost-Regular 2-Connected Graphs.

[BibT_eX]

[DOI]

J. Comb. Theory B, 1993

A Zero-Free Interval for Chromatic Polynomials of Graphs.

[BibT_eX]

[DOI]

Comb. Probab. Comput., 1993

Longest cycles in 3-connected planar graphs.

[BibT_eX]

[DOI]

,

J. Comb. Theory B, 1992

Dominating cycles in regular 3-connected graphs.

[BibT_eX]

[DOI]

,

Hao Li

,

Yongjin Zhu

Discret. Math., 1992

Neighborhood unions and hamilton cycles.

[BibT_eX]

[DOI]

J. Graph Theory, 1991

Supplementary Eulerian vectors in isotropic systems.

[BibT_eX]

[DOI]

J. Comb. Theory B, 1991

A characterisation of graphs having three pairwise compatible Euler tours.

[BibT_eX]

[DOI]

J. Comb. Theory B, 1991

Partitioning regular graphs into equicardinal linear forests.

[BibT_eX]

[DOI]

,

,

,

Discret. Math., 1991

Uniform cyclic edge connectivity in cubic graphs.

[BibT_eX]

[DOI]

Robert E. L. Aldred

,

Derek A. Holton

,

Comb., 1991

Shortest Circuit Covers and Postman Tours in Graphs with a Nowhere Zero 4-Flow.

[BibT_eX]

[DOI]

SIAM J. Comput., 1990

Cycles containing matchings and pairwise compatible euler tours.

[BibT_eX]

[DOI]

,

J. Graph Theory, 1990

Removable edges in 3-connected graphs.

[BibT_eX]

[DOI]

,

,

,

J. Graph Theory, 1990

On the maximum number of pairwise compatible euler cycles.

[BibT_eX]

[DOI]

,

Anthony J. W. Hilton

,

J. Graph Theory, 1990

Chvátal-Erdös conditions for paths and cycles in graphs and digraphs. A survey.

[BibT_eX]

[DOI]

,

Oscar Ordaz

Discret. Math., 1990

A note concerning paths and independence number in digraphs.

[BibT_eX]

[DOI]

Gena Hahn

,

Discret. Math., 1990

k-walks of graphs.

[BibT_eX]

[DOI]

,

Australas. J Comb., 1990

A note concerning graphs with unique f-factors.

[BibT_eX]

[DOI]

,

Robin W. Whitty

J. Graph Theory, 1989

Some remarks on Arc-connectivity, vertex splitting, and orientation in graphs and digraphs.

[BibT_eX]

[DOI]

J. Graph Theory, 1988

Edge-colouring random graphs.

[BibT_eX]

[DOI]

Alan M. Frieze

,

,

Colin J. H. McDiarmid

,

Bruce A. Reed

J. Comb. Theory B, 1988

Removable edges in cyclically 4-edge-connected cubic graphs.

[BibT_eX]

[DOI]

Lars Døvling Andersen

,

,

Graphs Comb., 1988

A note concerning the chromatic index of multigraphs.

[BibT_eX]

[DOI]

Anthony J. W. Hilton

,

J. Graph Theory, 1987

A Chvátal-Erdös condition for hamilton cycles in digraphs.

[BibT_eX]

[DOI]

J. Comb. Theory B, 1987

Large induced trees in sparse random graphs.

[BibT_eX]

[DOI]

Alan M. Frieze

,

J. Comb. Theory B, 1987

Compatible path-cycle-decompositions of plane graphs.

[BibT_eX]

[DOI]

,

J. Comb. Theory B, 1987

Compatible Euler tours for transition systems in Eulerian graphs.

[BibT_eX]

[DOI]

Discret. Math., 1987

Large holes in sparse random graphs.

[BibT_eX]

[DOI]

Alan M. Frieze

,

Comb., 1987

Longest cycles in 3-connected cubic graphs.

[BibT_eX]

[DOI]

J. Comb. Theory B, 1986

Toughness and the existence of k-factors.

[BibT_eX]

[DOI]

,

,

,

J. Graph Theory, 1985

Long cycles in bipartite graphs.

[BibT_eX]

[DOI]

J. Comb. Theory B, 1985

A Chvátal-Erdös condition for (1, 1)-factors in digraphs.

[BibT_eX]

[DOI]

,

Oscar Ordaz

Discret. Math., 1985

Shortest coverings of graphs with cycles.

[BibT_eX]

[DOI]

Jean-Claude Bermond

,

,

François Jaeger

J. Comb. Theory B, 1983

Long paths and cycles in oriented graphs.

[BibT_eX]

[DOI]

J. Graph Theory, 1981

Cycles in bipartite graphs.

[BibT_eX]

[DOI]

J. Comb. Theory B, 1981

Hamilton cycles in regular 2-connected graphs.

[BibT_eX]

[DOI]

J. Comb. Theory B, 1980

Hamilton cycles in regular graphs.

[BibT_eX]

[DOI]