default search action
Cristina Dalfó
Person information
- affiliation: Polytechnic University of Catalonia, Barcelona, Spain
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2024
- [j46]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) - [j45]M. A. Reyes
Structural and Spectral Properties of Chordal Ring, Multi-Ring, and Mixed Graphs. Symmetry 16(9): 1135 (2024) - [c4]Dominika Závacká, Cristina Dalfó, Miquel Angel Fiol:
Integer Sequences from k-iterated Line Digraphs. ITAT 2024: 156-161 - 2023
- [j44]Aida Abiad, Cristina Dalfó
On inertia and ratio type bounds for the k-independence number of a graph and their relationship. Discret. Appl. Math. 333: 96-109 (2023) - [j43]Cristina Dalfó
Moore mixed graphs from Cayley graphs. Electron. J. Graph Theory Appl. 11(1): 183-195 (2023) - [c3]Mónica Reyes, Cristina Dalfó, Miquel Angel Fiol:
On the Spectra and Spectral Radii of Token Graphs. ITAT 2023: 197-203 - 2021
- [j42]Katherina Böhmova, Cristina Dalfó, Clemens Huemer:
New cyclic Kautz digraphs with optimal diameter. Contributions Discret. Math. 16(3): 111-124 (2021) - [j41]Cristina Dalfó
New results for the Mondrian art problem. Discret. Appl. Math. 293: 64-73 (2021) - [j40]Cristina Dalfó
Decompositions of a rectangle into non-congruent rectangles of equal area. Discret. Math. 344(6): 112389 (2021) - [j39]Gabriela Araujo-Pardo
Bipartite biregular Moore graphs. Discret. Math. 344(11): 112582 (2021) - [j38]Camino Balbuena, Cristina Dalfó
Sufficient conditions for a digraph to admit a (1, \le l)-identifying code. Discuss. Math. Graph Theory 41(4): 853-872 (2021) - [j37]Cristina Dalfó
On d-Fibonacci digraphs. Electron. J. Graph Theory Appl. 9(2): 527-538 (2021) - 2020
- [j36]Camino Balbuena, Cristina Dalfó
Identifying codes in line digraphs. Appl. Math. Comput. 383: 125357 (2020) - [j35]Cristina Dalfó
An improved Moore bound and some new optimal families of mixed Abelian Cayley graphs. Discret. Math. 343(10): 112034 (2020)
2010 – 2019
- 2019
- [j34]Cristina Dalfó
An algebraic approach to lifts of digraphs. Discret. Appl. Math. 269: 68-76 (2019) - [j33]Cristina Dalfó
A new general family of mixed graphs. Discret. Appl. Math. 269: 99-106 (2019) - [j32]Cristina Dalfó
A new approach to gross error detection for GPS networks. Discret. Appl. Math. 269: 193-199 (2019) - [j31]Cristina Dalfó
On the Randić index of graphs. Discret. Math. 342(10): 2792-2796 (2019) - [j30]Cristina Dalfó
A Note on a New General Family of Deterministic Hierarchical Networks. J. Interconnect. Networks 19(2): 1950005:1-1950005:11 (2019) - [i3]Cristina Dalfó, Miquel A. Fiol:
El mètode de les línies per a la resolució numèrica d'equacions en derivades parcials. The method of lines for numerical solutions of partial differential equations. CoRR abs/1903.03431 (2019) - 2018
- [j29]Cristina Dalfó
An improved upper bound for the order of mixed graphs. Discret. Math. 341(10): 2872-2877 (2018) - [j28]Cristina Dalfó
Graphs, friends and acquaintances. Electron. J. Graph Theory Appl. 6(2): 282-305 (2018) - [j27]Cristina Dalfó
On bipartite-mixed graphs. J. Graph Theory 89(4): 386-394 (2018) - [j26]Cristina Dalfó
From Subkautz Digraphs to Cyclic Kautz Digraphs. J. Interconnect. Networks 18(2-3): 1850006:1-1850006:16 (2018) - 2017
- [j25]Cristina Dalfó
Sequence mixed graphs. Discret. Appl. Math. 219: 110-116 (2017) - [j24]Cristina Dalfó
A Note on the Order of Iterated Line Digraphs. J. Graph Theory 85(2): 395-399 (2017) - 2016
- [j23]Cristina Dalfó
The Degree/Diameter Problem in Maximal Planar Bipartite graphs. Electron. J. Comb. 23(1): 1 (2016) - 2015
- [j22]Cristina Dalfó
On middle cube graphs. Electron. J. Graph Theory Appl. 3(2): 133-145 (2015) - [j21]Katerina Böhmová, Cristina Dalfó
The Diameter of Cyclic Kautz Digraphs. Electron. Notes Discret. Math. 49: 323-330 (2015) - [i2]Lali Barrière, Francesc Comellas, Cristina Dalfó, Miguel Angel Fiol:
Deterministic hierarchical networks. CoRR abs/1507.05103 (2015) - 2014
- [j20]Aida Abiad, Cristina Dalfó
Corrigendum to "Algebraic characterizations of regularity properties in bipartite graphs" [European J. Combin. 34 (2013) 1223-1231]. Eur. J. Comb. 38: 130-132 (2014) - [j19]Cristina Dalfó, Miquel Angel Fiol:
The (Delta, D) and (Delta, N) problems in double-step digraphs with unilateral distance. Electron. J. Graph Theory Appl. 2(1): 1-17 (2014) - [j18]Cristina Dalfó
The degree/diameter problem in maximal planar bipartite graphs. Electron. Notes Discret. Math. 46: 73-80 (2014) - 2013
- [j17]Cristina Dalfó
Moments in graphs. Discret. Appl. Math. 161(6): 768-777 (2013) - [j16]Aida Abiad, Cristina Dalfó
Algebraic characterizations of regularity properties in bipartite graphs. Eur. J. Comb. 34(8): 1223-1231 (2013) - [j15]Francesc Comellas
The Manhattan product of digraphs. Electron. J. Graph Theory Appl. 1(1): 11-27 (2013) - [j14]Marc Cámara, Cristina Dalfó
Edge-distance-regular graphs are distance-regular. J. Comb. Theory A 120(5): 1057-1067 (2013) - 2012
- [j13]Cristina Dalfó
Dual concepts of almost distance-regularity and the spectral excess theorem. Discret. Math. 312(17): 2730-2734 (2012) - [i1]Cristina Dalfó, Miguel Angel Fiol:
The (Δ,D) and (Δ,N) problems for New Amsterdam and Manhattan digraphs. CoRR abs/1210.6202 (2012) - 2011
- [j12]Cristina Dalfó
A Differential Approach for Bounding the Index of Graphs under Perturbations. Electron. J. Comb. 18(1) (2011) - [j11]Marc Cámara, Cristina Dalfó
Edge-distance-regular graphs. Electron. Notes Discret. Math. 38: 221-226 (2011) - [j10]Cristina Dalfó
On almost distance-regular graphs. J. Comb. Theory A 118(3): 1094-1113 (2011) - [j9]Marc Cámara, Cristina Dalfó
Edge-distance-regular graphs. J. Comb. Theory A 118(7): 2071-2091 (2011) - 2010
- [j8]Cristina Dalfó
The geometry of t-spreads in k-walk-regular graphs. J. Graph Theory 64(4): 312-322 (2010)
2000 – 2009
- 2009
- [j7]Cristina Dalfó, Miguel Angel Fiol, Ernest Garriga:
On k-Walk-Regular Graphs. Electron. J. Comb. 16(1) (2009) - [j6]Lali Barrière, Francesc Comellas
The hierarchical product of graphs. Discret. Appl. Math. 157(1): 36-48 (2009) - [j5]Lali Barrière, Cristina Dalfó
The generalized hierarchical product of graphs. Discret. Math. 309(12): 3871-3881 (2009) - [j4]Cristina Dalfó
On t-Cliques in k-Walk-Regular Graphs. Electron. Notes Discret. Math. 34: 579-584 (2009) - 2008
- [j3]Francesc Comellas
Multidimensional Manhattan Street Networks. SIAM J. Discret. Math. 22(4): 1428-1447 (2008) - 2007
- [j2]Francesc Comellas, Cristina Dalfó
A Spectral Study of the Manhattan Networks. Electron. Notes Discret. Math. 29: 267-271 (2007) - [j1]Cristina Dalfó
The Multidimensional Manhattan Network. Electron. Notes Discret. Math. 29: 383-387 (2007) - 2005
- [c2]Francesc Comellas, Cristina Dalfó:
Optimal Broadcasting in 2-Dimensional Manhattan Street Networks. Parallel and Distributed Computing and Networks 2005: 141-146 - 2004
- [c1]Francesc Comellas, Cristina Dalfó
Using Genetic Programming to Design Broadcasting Algorithms for Manhattan Street Networks. EvoWorkshops 2004: 170-177
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-12-02 21:31 CET 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: