default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDNorma Zagaglia Salvi
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2010 – 2019
- 2018
[j25]Stefano Capparelli, Margherita Maria Ferrari, Emanuele Munarini, Norma Zagaglia Salvi:
A Generalization of the 'Problème des Rencontres'. J. Integer Seq. 21(2): 18.2.8 (2018)- 2017
- [j24]Margherita Maria Ferrari, Norma Zagaglia Salvi:
Aperiodic Compositions and Classical Integer Sequences. J. Integer Seq. 20(8): 17.8.8 (2017) - 2015
- [j23]Mirko Hornák
, Davide Mazza, Norma Zagaglia Salvi:
Edge Colorings of the Direct Product of Two Graphs. Graphs Comb. 31(4): 975-992 (2015) - 2013
- [j22]Francesco Maffioli, Norma Zagaglia Salvi:
On Binary Matroids Not Isomorphic To Their Base Matroids. Ars Comb. 109: 247-256 (2013) - 2012
- [j21]Mario Gionfriddo, Guglielmo Lunardon, Norma Zagaglia Salvi:
Preface. Discret. Math. 312(3): 487 (2012) - 2011
- [j20]Laura Frigerio, Federico Lastaria, Norma Zagaglia Salvi:
Adjacent vertex distinquishing edge colorings of the direct product of a regular graph by a path or cycle. Discuss. Math. Graph Theory 31(3): 547-557 (2011) - 2010
- [j19]Francesco Maffioli, Norma Zagaglia Salvi:
A characterization of the base-matroids of a graphic matroid. Contributions Discret. Math. 5(1) (2010) - [j18]Alpar Vajk Kramer, Federico Lastaria, Norma Zagaglia Salvi:
Perfect matchings of a graph associated with a binary de Bruijn digraph. Discret. Math. 310(22): 3241-3245 (2010) - [j17]Alpar Vajk Kramer, Norma Zagaglia Salvi:
Particular cycles of a binary de Bruijn digraph. Eur. J. Comb. 31(2): 589-597 (2010)
2000 – 2009
- 2008
- [j16]Rodolfo Salvi, Norma Zagaglia Salvi:
Alternating unimodal sequences of Whitney numbers. Ars Comb. 87 (2008) - [j15]Emanuele Munarini, Claudio Perelli Cippo, Andrea Scagliola, Norma Zagaglia Salvi:
Double graphs. Discret. Math. 308(2-3): 242-254 (2008) - 2006
- [j14]Mirko Hornák, Norma Zagaglia Salvi:
On The Point-Distinguishing Chromatic Index Of Complete Bipartite Graphs. Ars Comb. 80 (2006) - [j13]Francesco Maffioli, Norma Zagaglia Salvi:
On some properties of base-matroids. Discret. Appl. Math. 154(9): 1401-1407 (2006) - 2004
- [j12]Francesco Maffioli, Norma Zagaglia Salvi:
A particular class of graphic matroids. Electron. Notes Discret. Math. 17: 219-222 (2004) - [c1]Francesco Maffioli, Norma Zagaglia Salvi:
A Particular Class of Graphic Matroids. CTW 2004: 192-195 - 2003
- [j11]Titus Hilberdink, Carol A. Whitehead, Norma Zagaglia Salvi:
On a Problem on Generalised Fibonacci Cubes. Ars Comb. 68 (2003) - [j10]Carol A. Whitehead, Norma Zagaglia Salvi:
Observability of the extended Fibonacci cubes. Discret. Math. 266(1-3): 431-440 (2003) - [j9]Emanuele Munarini, Norma Zagaglia Salvi:
Scattered subsets. Discret. Math. 267(1-3): 213-228 (2003) - [j8]Francesco Maffioli, Norma Zagaglia Salvi:
On Some Properties of Base-matroids. Electron. Notes Discret. Math. 13: 69-70 (2003) - 2002
- [j7]Ernesto Dedó, Damiano Torri, Norma Zagaglia Salvi:
The observability of the Fibonacci and the Lucas cubes. Discret. Math. 255(1-3): 55-63 (2002) - [j6]Emanuele Munarini, Norma Zagaglia Salvi:
Structural and enumerative properties of the Fibonacci cubes. Discret. Math. 255(1-3): 317-324 (2002) - [j5]Emanuele Munarini, Norma Zagaglia Salvi:
On the rank polynomial of the lattice of order ideals of fences and crowns. Discret. Math. 259(1-3): 163-177 (2002)
1990 – 1999
- 1997
- [j4]Ernesto Dedó, Norma Zagaglia Salvi, Stephen J. Kirkland:
A Particular Class Of Bigraphs. Ars Comb. 45 (1997) - 1996
- [j3]Norma Zagaglia Salvi:
Maximal intersection critical families of finite sets. Discret. Math. 155(1-3): 267-269 (1996) - 1993
- [j2]Norma Zagaglia Salvi:
A note on the line-distinguishing chromatic number and the chromatic index of a graph. J. Graph Theory 17(5): 589-591 (1993) - 1992
- [j1]Dragan Marusic, Raffaele Scapellato, Norma Zagaglia Salvi:
Generalized Cayley graphs. Discret. Math. 102(3): 279-285 (1992)
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-24 23:06 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:
