Stop the war!Остановите войну!
for scientists:
default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDJ. Adrian Bondy
Person information
- affiliation: Pierre and Marie Curie University, IMJ-PRG, Paris, France
- affiliation: Claude Bernard University Lyon 1, Camille Jordan Institute, France
- affiliation: University of Waterloo, Departnent of Combinatorics and Optimization, ON, Canada
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
Books and Theses
- 2008
[b2]J. Adrian Bondy, Uppaluri S. R. Murty:
Graph Theory. Graduate Texts in Mathematics, Springer 2008, ISBN 978-1-84628-970-5, pp. 1-582- 1976
- [b1]J. Adrian Bondy, Uppaluri S. R. Murty:
Graph Theory with Applications. Macmillan Education UK 1976, ISBN 978-1-349-03521-2, pp. 1-226
Journal Articles
- 2017
- [j43]J. Adrian Bondy, Zbigniew Lonc
, Pawel Rzazewski:
Erratum: Constructing Optimal k-Radius Sequences. SIAM J. Discret. Math. 31(1): 645-646 (2017) - 2016
- [j42]J. Adrian Bondy, Zbigniew Lonc, Pawel Rzazewski:
Constructing Optimal k-Radius Sequences. SIAM J. Discret. Math. 30(1): 452-464 (2016) - 2015
- [j41]Laurent Beaudou, J. Adrian Bondy, Xiaomin Chen, Ehsan Chiniforooshan, Maria Chudnovsky, Vasek Chvátal, Nicolas Fraiman, Yori Zwols:
A De Bruijn-Erdős Theorem for Chordal Graphs. Electron. J. Comb. 22(1): 1 (2015) - 2014
- [j40]Pierre Aboulker, J. Adrian Bondy, Xiaomin Chen, Ehsan Chiniforooshan, Vasek Chvátal, Peihan Miao:
Number of lines in hypergraphs. Discret. Appl. Math. 171: 137-140 (2014) - [j39]J. Adrian Bondy:
Beautiful conjectures in graph theory. Eur. J. Comb. 37: 4-23 (2014) - 2013
- [j38]Laurent Beaudou, J. Adrian Bondy, Xiaomin Chen, Ehsan Chiniforooshan, Maria Chudnovsky, Vasek Chvátal, Nicolas Fraiman, Yori Zwols:
Lines in hypergraphs. Comb. 33(6): 633-654 (2013) - [j37]J. Adrian Bondy, Jayme Luiz Szwarcfiter:
Induced Decompositions of Graphs. J. Graph Theory 72(4): 462-477 (2013) - 2011
- [j36]J. Adrian Bondy, F. Mercier:
Switching reconstruction of digraphs. J. Graph Theory 67(4): 332-348 (2011) - 2009
- [j35]Etienne Birmelé, J. Adrian Bondy, Bruce A. Reed:
Tree-width of graphs without a 3×3 grid minor. Discret. Appl. Math. 157(12): 2577-2596 (2009) - [j34]J. Adrian Bondy, X. Buchwalder, F. Mercier:
Lexicographic Products and a Conjecture of Hahn and Jackson. SIAM J. Discret. Math. 23(2): 882-887 (2009) - 2007
- [j33]Etienne Birmelé, J. Adrian Bondy, Bruce A. Reed:
The Erdös-Pósa Property For Long Circuits. Comb. 27(2): 135-145 (2007) - [j32]David Avis, J. Adrian Bondy, William J. Cook, Bruce A. Reed:
Vašek Chvátal: A Very Short Introduction. Graphs Comb. 23(Supplement-1): 41-65 (2007) - 2006
- [j31]J. Adrian Bondy, Jian Shen, Stéphan Thomassé, Carsten Thomassen:
Density Conditions For Triangles In Multipartite Graphs. Comb. 26(2): 121-131 (2006) - [j30]J. Adrian Bondy, Vasek Chvátal:
Preface. Discret. Math. 306(19-20): 2293-2295 (2006) - 2003
- [j29]J. Adrian Bondy:
Short proofs of classical theorems. J. Graph Theory 44(3): 159-165 (2003) - [j28]J. Adrian Bondy, Guillermo Durán, Min Chih Lin, Jayme Luiz Szwarcfiter:
Self-clique graphs and matrix permutations. J. Graph Theory 44(3): 178-192 (2003) - 2002
- [j27]J. Adrian Bondy, Hajo Broersma, Jan van den Heuvel, Henk Jan Veldman:
Heavy cycles in weighted graphs. Discuss. Math. Graph Theory 22(1): 7-15 (2002) - 2001
- [j26]J. Adrian Bondy, Guillermo Durán, Min Chih Lin, Jayme Luiz Szwarcfiter:
A sufficient condition for self-clique graphs. Electron. Notes Discret. Math. 7: 174-177 (2001) - 1999
- [j25]J. Adrian Bondy, Paul Erdös, Siemion Fajtlowicz:
Graphs of diameter two with no 4-circuits. Discret. Math. 200(1-3): 21-25 (1999) - 1998
- [j24]J. Adrian Bondy, Bill Jackson:
Vertices of Small Degree in Uniquely Hamiltonian Graphs. J. Comb. Theory, Ser. B 74(2): 265-275 (1998) - [j23]J. Adrian Bondy, Andrew Vince:
Cycles in a graph whose lengths differ by one or two. J. Graph Theory 27(1): 11-15 (1998) - 1997
- [j22]J. Adrian Bondy:
Counting subgraphs a new approach to the Caccetta-Häggkvist conjecture. Discret. Math. 165-166: 71-80 (1997) - 1995
- [j21]J. Adrian Bondy:
A short proof of the Chen-Manalastas theorem. Discret. Math. 146(1-3): 289-292 (1995) - 1992
- [j20]J. Adrian Bondy, Stephen C. Locke:
Triangle-free subgraphs of powers of cycles. Graphs Comb. 8(2): 109-118 (1992) - 1991
- [j19]J. Adrian Bondy, Genghua Fan:
Cycles in weighted graphs. Comb. 11(3): 191-205 (1991) - 1990
- [j18]J. Adrian Bondy:
Perfect path double covers of graphs. J. Graph Theory 14(2): 259-272 (1990) - [j17]J. Adrian Bondy, Pavol Hell:
A note on the star chromatic number. J. Graph Theory 14(4): 479-482 (1990) - 1989
- [j16]J. Adrian Bondy:
Trigraphs. Discret. Math. 75(1-3): 69-79 (1989) - 1988
- [j15]J. Adrian Bondy, Mekkia Kouider:
Hamilton cycles in regular 2-connected graphs. J. Comb. Theory, Ser. B 44(2): 177-186 (1988) - 1987
- [j14]J. Adrian Bondy, Genghua Fan:
A sufficient condition for dominating cycles. Discret. Math. 67(2): 205-208 (1987) - 1986
- [j13]J. Adrian Bondy, F. Y. Halberstam:
Parity theorems for paths and cycles in graphs. J. Graph Theory 10(1): 107-115 (1986) - 1985
- [j12]J. Adrian Bondy, László Lovász:
Lengths of cycles in halin graphs. J. Graph Theory 9(3): 397-410 (1985) - 1983
- [j11]J. Adrian Bondy, Pavol Hell:
Counterexamples to theorems of Menger type for the diameter. Discret. Math. 44(2): 217-220 (1983) - [j10]J. Adrian Bondy:
Large dense neighbourhoods and turán's theorem. J. Comb. Theory, Ser. B 34(1): 109-111 (1983) - [j9]J. Adrian Bondy:
Erratum. J. Comb. Theory, Ser. B 35(1): 80 (1983) - 1981
- [j8]J. Adrian Bondy, László Lovász:
Cycles through specified vertices of a graph. Comb. 1(2): 117-140 (1981) - [j7]J. Adrian Bondy, Stephen C. Locke:
Relative lengths of paths and cycles in 3-connected graphs. Discret. Math. 33(2): 111-122 (1981) - 1978
- [j6]J. Adrian Bondy:
A remark on two sufficient conditions for hamilton cycles. Discret. Math. 22(2): 191-193 (1978) - [j5]J. Adrian Bondy:
Extremal graphs with prescribed covering number. J. Comb. Theory, Ser. B 24(1): 51-52 (1978) - 1977
- [j4]J. Adrian Bondy, Carsten Thomassen:
A short proof of Meyniel's theorem. Discret. Math. 19(2): 195-197 (1977) - [j3]J. Adrian Bondy, Robert L. Hemminger:
Graph reconstruction - a survey. J. Graph Theory 1(3): 227-268 (1977) - 1976
- [j2]J. Adrian Bondy, Vasek Chvátal:
A method in graph theory. Discret. Math. 15(2): 111-135 (1976) - 1971
- [j1]J. Adrian Bondy:
Large cycles in graphs. Discret. Math. 1(2): 121-132 (1971)
Coauthor Index
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
Unpaywalled article links
Add open access links from 
to the list of external document links (if available).
Privacy notice: By enabling the option above, your browser will contact the API of unpaywall.org to load hyperlinks to open access articles. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Unpaywall privacy policy.
Archived links via Wayback Machine
For web page which are no longer available, try to retrieve content from the 
of the Internet Archive (if available).
Privacy notice: By enabling the option above, your browser will contact the API of archive.org to check for archived content of web pages that are no longer available. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Internet Archive privacy policy.
Reference lists
Add a list of references from 
, 
, and 
to record detail pages.
load references from crossref.org and opencitations.net
Privacy notice: By enabling the option above, your browser will contact the APIs of crossref.org, opencitations.net, and semanticscholar.org to load article reference information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Crossref privacy policy and the OpenCitations privacy policy, as well as the AI2 Privacy Policy covering Semantic Scholar.
Citation data
Add a list of citing articles from and to record detail pages.
load citations from opencitations.net
Privacy notice: By enabling the option above, your browser will contact the API of opencitations.net and semanticscholar.org to load citation information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the OpenCitations privacy policy as well as the AI2 Privacy Policy covering Semantic Scholar.
OpenAlex data
Load additional information about publications from 
.
Privacy notice: By enabling the option above, your browser will contact the API of openalex.org to load additional information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the information given by OpenAlex.
last updated on 2024-04-25 05:42 CEST by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by:
