default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDArieh Lev
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2021
[j16]Marcel Herzog, Gil Kaplan, Arieh Lev, Romina Zigdon:
$r$-Critical Numbers of Natural Intervals. Electron. J. Comb. 28(4) (2021)
2010 – 2019
- 2019
- [j15]Iris Gaber, Arieh Lev, Romina Zigdon:
Insights and Observations on Teaching the Intermediate Value Theorem. Am. Math. Mon. 126(9): 845-849 (2019) - 2017
- [j14]Gideon Dror, Arieh Lev, Yehuda Roditty, Romina Zigdon:
On the rainbow connection number of graphs. Ars Comb. 133: 51-67 (2017)
2000 – 2009
- 2009
- [j13]Gil Kaplan, Arieh Lev, Yehuda Roditty:
On graph labeling problems and regular decompositions of complete graphs. Ars Comb. 92 (2009) - [j12]Gil Kaplan, Arieh Lev, Yehuda Roditty:
On zero-sum partitions and anti-magic trees. Discret. Math. 309(8): 2010-2014 (2009) - 2008
- [j11]Yair Caro, Arieh Lev, Yehuda Roditty, Zsolt Tuza, Raphael Yuster:
On Rainbow Connection. Electron. J. Comb. 15(1) (2008) - [j10]Gil Kaplan, Arieh Lev, Yehuda Roditty:
Bertrand's postulate, the prime number theorem and product anti-magic graphs. Discret. Math. 308(5-6): 787-794 (2008) - [j9]Marcel Herzog, Gil Kaplan, Arieh Lev:
Covering the alternating groups by products of cycle classes. J. Comb. Theory A 115(7): 1235-1245 (2008) - 2004
- [j8]Marcel Herzog, Gil Kaplan, Arieh Lev:
Representation of permutations as products of two cycles. Discret. Math. 285(1-3): 323-327 (2004) - [j7]Gideon Dror, Arieh Lev, Yehuda Roditty:
A note: some results in step domination of trees. Discret. Math. 289(1-3): 137-144 (2004) - [j6]Noga Alon, Gil Kaplan, Arieh Lev, Yehuda Roditty, Raphael Yuster:
Dense graphs are antimagic. J. Graph Theory 47(4): 297-309 (2004) - 2003
- [j5]Yair Caro, Arieh Lev, Yehuda Roditty:
Some results in step domination of graphs. Ars Comb. 68 (2003) - 2002
- [j4]Gil Kaplan, Arieh Lev, Yehuda Roditty:
Transitive large sets of disjoint decompositions and group sequencings. Discret. Math. 254(1-3): 207-219 (2002) - [j3]Ilia Krasikov, Arieh Lev, Bhalchandra D. Thatte:
Upper bounds on the automorphism group of a graph0. Discret. Math. 256(1-2): 489-493 (2002) - 2001
- [j2]Gil Kaplan, Arieh Lev, Yehuda Roditty:
Regular Oberwolfach Problems and Group Sequencings. J. Comb. Theory A 96(1): 1-19 (2001) - 2000
- [j1]Arieh Lev, Yehuda Roditty:
On Hering Decomposition ofDKnInduced by Group Actions on Conjugacy Classes. Eur. J. Comb. 21(3): 379-393 (2000)
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-06-10 20:29 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:
