J. Adrian Bondy

Affiliations:
  • Pierre and Marie Curie University, IMJ-PRG, Paris, France
  • Claude Bernard University Lyon 1, Camille Jordan Institute, France
  • University of Waterloo, Departnent of Combinatorics and Optimization, ON, Canada


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

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

Timeline

Legend:

Book 
In proceedings 
Article 
PhD thesis 
Dataset
Other 

Links

Online presence:

On csauthors.net:

Bibliography

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

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

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

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

Number of lines in hypergraphs.
Discret. Appl. Math., 2014

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

Lines in hypergraphs.
Comb., 2013

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

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

Tree-width of graphs without a 3×3 grid minor.
Discret. Appl. Math., 2009

2008
Graph Theory
Graduate Texts in Mathematics, Springer, ISBN: 978-1-84628-970-5, 2008

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

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

2006
Preface.
Discret. Math., 2006

Density Conditions For Triangles In Multipartite Graphs.
Comb., 2006

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

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

2002
Heavy cycles in weighted graphs.
Discuss. Math. Graph Theory, 2002

2001
A sufficient condition for self-clique graphs.
Electron. Notes Discret. Math., 2001

1999
Graphs of diameter two with no 4-circuits.
Discret. Math., 1999

1998
Cycles in a graph whose lengths differ by one or two.
J. 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.
Discret. Math., 1997

1995
A short proof of the Chen-Manalastas theorem.
Discret. Math., 1995

1992
Triangle-free subgraphs of powers of cycles.
Graphs Comb., 1992

1991
Cycles in weighted graphs.
Comb., 1991

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

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

1989
Trigraphs.
Discret. Math., 1989

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

1987
A sufficient condition for dominating cycles.
Discret. Math., 1987

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

1985
Lengths of cycles in halin graphs.
J. 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.
Discret. Math., 1983

1981
Relative lengths of paths and cycles in 3-connected graphs.
Discret. Math., 1981

Cycles through specified vertices of a graph.
Comb., 1981

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

A remark on two sufficient conditions for hamilton cycles.
Discret. Math., 1978

1977
Graph reconstruction - a survey.
J. Graph Theory, 1977

A short proof of Meyniel's theorem.
Discret. Math., 1977

1976
A method in graph theory.
Discret. Math., 1976

Graph Theory with Applications
Macmillan Education UK, ISBN: 978-1-349-03521-2, 1976

1971
Large cycles in graphs.
Discret. Math., 1971


  Loading...