John Adrian Bondy

According to our database1, John Adrian Bondy authored at least 43 papers between 1971 and 2017.

Collaborative distances:
  • Dijkstra number2 of four.
  • Erdős number3 of one.

Timeline

Legend:

Book 
In proceedings 
Article 
PhD thesis 
Other 

Links

Homepages:

On csauthors.net:

Bibliography

2017
Erratum: Constructing Optimal k-Radius Sequences.
SIAM J. Discrete Math., 2017

2016
Constructing Optimal k-Radius Sequences.
SIAM J. Discrete Math., 2016

2015
A De Bruijn-Erdős Theorem for Chordal Graphs.
Electr. J. Comb., 2015

2014
Beautiful conjectures in graph theory.
Eur. J. Comb., 2014

Number of lines in hypergraphs.
Discrete Applied Mathematics, 2014

2013
Induced Decompositions of Graphs.
Journal of Graph Theory, 2013

Lines in hypergraphs.
Combinatorica, 2013

2011
Switching reconstruction of digraphs.
Journal of Graph Theory, 2011

2009
Lexicographic Products and a Conjecture of Hahn and Jackson.
SIAM J. Discrete Math., 2009

Tree-width of graphs without a 3×3 grid minor.
Discrete Applied Mathematics, 2009

2007
Vašek Chvátal: A Very Short Introduction.
Graphs and Combinatorics, 2007

The Erdös-Pósa Property For Long Circuits.
Combinatorica, 2007

2006
Preface.
Discrete Mathematics, 2006

Density Conditions For Triangles In Multipartite Graphs.
Combinatorica, 2006

2003
Self-clique graphs and matrix permutations.
Journal of Graph Theory, 2003

Short proofs of classical theorems.
Journal of Graph Theory, 2003

2002
Heavy cycles in weighted graphs.
Discussiones Mathematicae Graph Theory, 2002

2001
A sufficient condition for self-clique graphs.
Electronic Notes in Discrete Mathematics, 2001

1999
Graphs of diameter two with no 4-circuits.
Discrete Mathematics, 1999

1998
Cycles in a graph whose lengths differ by one or two.
Journal of Graph Theory, 1998

Vertices of Small Degree in Uniquely Hamiltonian Graphs.
J. Comb. Theory, Ser. B, 1998

1997
Counting subgraphs a new approach to the Caccetta-Häggkvist conjecture.
Discrete Mathematics, 1997

1995
A short proof of the Chen-Manalastas theorem.
Discrete Mathematics, 1995

1992
Triangle-free subgraphs of powers of cycles.
Graphs and Combinatorics, 1992

1991
Cycles in weighted graphs.
Combinatorica, 1991

1990
A note on the star chromatic number.
Journal of Graph Theory, 1990

Perfect path double covers of graphs.
Journal of Graph Theory, 1990

1989
Trigraphs.
Discrete Mathematics, 1989

1988
Hamilton cycles in regular 2-connected graphs.
J. Comb. Theory, Ser. B, 1988

1987
A sufficient condition for dominating cycles.
Discrete Mathematics, 1987

1986
Parity theorems for paths and cycles in graphs.
Journal of Graph Theory, 1986

1985
Lengths of cycles in halin graphs.
Journal of Graph Theory, 1985

1983
Large dense neighbourhoods and turán's theorem.
J. Comb. Theory, Ser. B, 1983

Erratum.
J. Comb. Theory, Ser. B, 1983

Counterexamples to theorems of Menger type for the diameter.
Discrete Mathematics, 1983

1981
Relative lengths of paths and cycles in 3-connected graphs.
Discrete Mathematics, 1981

Cycles through specified vertices of a graph.
Combinatorica, 1981

1978
Extremal graphs with prescribed covering number.
J. Comb. Theory, Ser. B, 1978

A remark on two sufficient conditions for hamilton cycles.
Discrete Mathematics, 1978

1977
Graph reconstruction - a survey.
Journal of Graph Theory, 1977

A short proof of Meyniel's theorem.
Discrete Mathematics, 1977

1976
A method in graph theory.
Discrete Mathematics, 1976

1971
Large cycles in graphs.
Discrete Mathematics, 1971


  Loading...