![](https://dblp.uni-trier.de/img/logo.ua.320x120.png)
![](https://dblp.uni-trier.de/img/dropdown.dark.16x16.png)
![](https://dblp.uni-trier.de/img/peace.dark.16x16.png)
Остановите войну!
for scientists:
![search dblp search dblp](https://dblp.uni-trier.de/img/search.dark.16x16.png)
![search dblp](https://dblp.uni-trier.de/img/search.dark.16x16.png)
default search action
Nacho López
Person information
Refine list
![note](https://dblp.uni-trier.de/img/note-mark.dark.12x12.png)
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2024
- [j27]Cristina Dalfó, Grahame Erskine, Geoffrey Exoo, Miguel Angel Fiol, Nacho López, Arnau Messegué, James Tuite:
On large regular (1,1,k)-mixed graphs. Discret. Appl. Math. 356: 209-228 (2024) - 2023
- [j26]Nacho López
, Arnau Messegué
, Josep M. Miret:
Nonexistence of Almost Moore Digraphs of Degrees 4 and 5 with Self-Repeats. Electron. J. Comb. 30(1) (2023) - 2022
- [j25]Gabriela Araujo
, Nacho López
:
On New Record Graphs Close to Bipartite Moore Graphs. Graphs Comb. 38(4): 110 (2022) - 2021
- [j24]Cristina Dalfó
, Miguel Angel Fiol, Nacho López
:
New results for the Mondrian art problem. Discret. Appl. Math. 293: 64-73 (2021) - [j23]Pol Llagostera, Nacho López
, Carles Comas:
Network reliability in hamiltonian graphs. Discret. Optim. 41: 100645 (2021) - [j22]Cristina Dalfó
, Miquel A. Fiol, Nacho López
, Álvaro Martínez-Pérez
:
Decompositions of a rectangle into non-congruent rectangles of equal area. Discret. Math. 344(6): 112389 (2021) - [j21]Gabriela Araujo-Pardo
, Cristina Dalfó
, Miquel A. Fiol, Nacho López
:
Bipartite biregular Moore graphs. Discret. Math. 344(11): 112582 (2021) - 2020
- [j20]Cristina Dalfó
, Miguel Angel Fiol, Nacho López
, Joseph F. Ryan:
An improved Moore bound and some new optimal families of mixed Abelian Cayley graphs. Discret. Math. 343(10): 112034 (2020)
2010 – 2019
- 2019
- [j19]Nacho López
, Hebert Pérez-Rosés
, Jordi Pujolàs
, Mária Zdímalová:
Construction of extremal mixed graphs of diameter two. Discret. Appl. Math. 263: 204-211 (2019) - 2018
- [j18]Cristina Dalfó
, Miguel Angel Fiol, Nacho López
:
An improved upper bound for the order of mixed graphs. Discret. Math. 341(10): 2872-2877 (2018) - [j17]Cristina Dalfó
, Miguel Angel Fiol, Nacho López
:
On bipartite-mixed graphs. J. Graph Theory 89(4): 386-394 (2018) - 2017
- [j16]Cristina Dalfó
, Miguel Angel Fiol, Nacho López
:
Sequence mixed graphs. Discret. Appl. Math. 219: 110-116 (2017) - [j15]Nacho López
, Hebert Pérez-Rosés
, Jordi Pujolàs
:
The Degree/Diameter Problem for mixed abelian Cayley graphs. Discret. Appl. Math. 231: 190-197 (2017) - [j14]Dominique Buset, Nacho López
, Josep M. Miret:
The Unique Mixed Almost Moore Graph with Parameters k = 2, r = 2 and z = 1. J. Interconnect. Networks 17(3-4): 1741005:1-1741005:10 (2017) - 2016
- [j13]Nacho López
, Josep M. Miret:
On Mixed Almost Moore Graphs of Diameter Two. Electron. J. Comb. 23(2): 2 (2016) - [j12]Nacho López
, Josep M. Miret
, Cèsar Fernández:
Non existence of some mixed Moore graphs of diameter 2 using SAT. Discret. Math. 339(2): 589-596 (2016) - [j11]Nacho López
, Hebert Pérez-Rosés
, Jordi Pujolàs
:
A Moore-like bound for mixed abelian Cayley graphs. Electron. Notes Discret. Math. 54: 145-150 (2016) - [j10]Nacho López
, Hebert Pérez-Rosés
, Jordi Pujolàs
, Mária Zdímalová:
A variant of the McKay-Miller-Širáň construction for mixed graphs. Electron. Notes Discret. Math. 54: 151-156 (2016) - 2015
- [j9]Nacho López
, Jordi Pujolàs
:
Properties of mixed Moore graphs of directed degree one. Discret. Math. 338(4): 522-526 (2015) - [c2]Nacho López
, Hebert Pérez-Rosés
:
Degree/diameter Problem for Mixed Graphs. ICGTIS 2015: 2-9 - 2014
- [j8]Ljiljana Brankovic, Nacho López
, Mirka Miller, Francesc Sebé:
Triangle randomization for social network data anonymization. Ars Math. Contemp. 7(2): 461-477 (2014) - [j7]Nacho López
, Hebert Pérez-Rosés
, Jordi Pujolàs
:
Mixed Moore Cayley graphs. Electron. Notes Discret. Math. 46: 193-200 (2014) - 2013
- [j6]Joan Gimbert, Nacho López:
On the construction of radially Moore digraphs. Ars Comb. 110: 455-467 (2013) - [j5]Nacho López
, Francesc Sebé
:
Privacy preserving release of blogosphere data in the presence of search engines. Inf. Process. Manag. 49(4): 833-851 (2013) - [c1]Nacho López
, Francesc Sebé:
Degree Sequences of PageRank Uniform Graphs and Digraphs with Prime Outdegrees. IWOCA 2013: 303-313 - 2012
- [j4]Geoffrey Exoo, Joan Gimbert, Nacho López
, José Gómez:
Radial Moore graphs of radius three. Discret. Appl. Math. 160(10-11): 1507-1512 (2012) - 2010
- [j3]Carles Capdevila, Josep Conde
, Geoffrey Exoo, Joan Gimbert, Nacho López
:
Ranking measures for radially Moore graphs. Networks 56(4): 255-262 (2010)
2000 – 2009
- 2008
- [j2]Joan Gimbert, Nacho López:
Eccentricity sequences and eccentricity sets in digraphs. Ars Comb. 86 (2008) - 2006
- [j1]Joan Gimbert, Nacho López
, Mirka Miller, Joseph F. Ryan:
Characterization of eccentric digraphs. Discret. Math. 306(2): 210-219 (2006)
Coauthor Index
![](https://dblp.uni-trier.de/img/cog.dark.24x24.png)
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-08-03 21:09 CEST by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint