default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDAndrea Vietri
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2022
[j19]Stefano Capparelli, Alberto Del Fra, Andrea Vietri:
Searching for Hyperbolic Polynomials with Span Less than 4. Exp. Math. 31(3): 830-842 (2022)- 2020
- [j18]Simona Bonvicini, Andrea Vietri:
A Möbius-type gluing technique for obtaining edge-critical graphs. Ars Math. Contemp. 19(2): 209-229 (2020)
2010 – 2019
- 2019
- [j17]Andrea Vietri:
On the graceful polynomials of a graph. Australas. J Comb. 73: 261-273 (2019) - 2015
- [j16]Andrea Vietri:
A New Zero-divisor Graph Contradicting Beck's Conjecture, and the Classification for a Family of Polynomial Quotients. Graphs Comb. 31(6): 2413-2423 (2015) - [j15]Andrea Vietri:
An Analogy Between Edge Colourings and Differentiable Manifolds, with a New Perspective on 3-Critical Graphs. Graphs Comb. 31(6): 2425-2435 (2015) - 2011
- [j14]Andrea Vietri:
Real-graceful labellings: a generalisation of graceful labellings. Ars Comb. 102: 359-364 (2011)
2000 – 2009
- 2008
- [j13]Andrea Vietri:
A new infinite family of graceful generalised Petersen graphs, via graceful collages again. Australas. J Comb. 41: 273-282 (2008) - 2007
- [j12]Andrea Vietri:
On certain 2-rotational cycle systems of complete graphs. Australas. J Comb. 37: 73-80 (2007) - [j11]Andrea Vietri:
Nice lists of differences, and their connections with algebraic properties of unitary polynomials. Australas. J Comb. 37: 171-186 (2007) - [j10]Andrea Vietri:
Erratum: a little emendation to the graceful labelling of the Generalized Petersen Graph P8t, 3 when t = 5. Ars Comb. 83 (2007) - [j9]Andrea Vietri:
Colouring walls may help to make good schedules. Ars Comb. 84 (2007) - [j8]Andrea Vietri:
Difference Families in Z2d+1(+)Z2d+1 and Infinite Translation Designs in Z(+)Z. Graphs Comb. 23(1): 111-121 (2007) - 2006
- [j7]Andrea Vietri:
Graceful labellings for an infinite class of generalised Petersen graphs. Ars Comb. 81 (2006) - 2005
- [j6]Andrea Vietri:
Chromatic number of regular walls. Ars Comb. 76 (2005) - [j5]Andrea Vietri:
On the Posets (W2k, <) and their Connections with Some Homogeneous Inequalities of Degree 2. Order 22(3): 201-221 (2005) - 2004
- [j4]Andrea Vietri:
The complexity of arc-colorings for directed hypergraphs. Discret. Appl. Math. 143(1-3): 266-271 (2004) - [j3]Andrea Vietri:
The complexity of arc-colorings for directed hypergraphs. Electron. Notes Discret. Math. 17: 281-284 (2004) - [c2]Andrea Vietri:
The Complexity of Arc-coloring for Directed Hypergraphs. CTW 2004: 242-245 - [c1]Andrea Vietri:
Arc-Coloring of Directed Hypergraphs and Brick-Coloring of Walls. IV 2004: 394-399 - 2002
- [j2]Andrea Vietri:
Combinatorial Aspects of Total Weight Orders over Monomials of Fixed Degree. Order 19(3): 239-263 (2002) - [j1]Andrea Vietri:
An Inductive Proof of a Known Result about ψ(x). Am. Math. Mon. 109(4): 390-391 (2002)
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:58 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:
