Josep Fàbrega

Orcid: 0000-0002-4922-8562

According to our database1, Josep Fàbrega authored at least 32 papers between 1989 and 2023.

Collaborative distances:
  • Dijkstra number2 of four.
  • Erdős number3 of two.

Timeline

Legend:

Book 
In proceedings 
Article 
PhD thesis 
Dataset
Other 

Links

Online presence:

On csauthors.net:

Bibliography

2023
Distance-layer structure of the De Bruijn and Kautz digraphs: Analysis and application to deflection routing.
Networks, December, 2023

Immune sets in monotone infection rules. Characterization and complexity.
Discret. Appl. Math., November, 2023

2021
Uniform forcing and immune sets in graphs and hypergraphs.
Discret. Appl. Math., 2021

2018
Online Matching in Regular Bipartite Graphs with Randomized Adversary.
Proceedings of the Adventures Between Lower Bounds and Higher Altitudes, 2018

2016
Layer structure of De Bruijn and Kautz digraphs. An application to deflection routing.
Electron. Notes Discret. Math., 2016

2014
On the local spectra of the subconstituents of a vertex set and completely pseudo-regular codes.
Discret. Appl. Math., 2014

2011
On large (Δ, <i>D</i>, <i>D</i>, 1)-graphs.
Networks, 2011

Edge-distance-regular graphs.
J. Comb. Theory A, 2011

2010
Combinatorial vs. Algebraic Characterizations of Completely Pseudo-Regular Codes.
Electron. J. Comb., 2010

2009
Some Families of Orthogonal Polynomials of a Discrete Variable and their Applications to Graphs and Codes.
Electron. J. Comb., 2009

2007
Edge-connectivity and edge-superconnectivity in sequence graphs.
Discret. Appl. Math., 2007

2005
Connectedness of digraphs and graphs under constraints on the conditional diameter.
Networks, 2005

(<i>delta</i>, <i>g</i>)-cages with <i>g</i> geq 10 are 4-connected.
Discret. Math., 2005

2003
Using a progressive withdrawal procedure to study superconnectivity in digraphs.
Discret. Math., 2003

A Study of Network Capacity under Deflection Routing Schemes.
Proceedings of the Euro-Par 2003. Parallel Processing, 2003

Connectivity and Traversability.
Proceedings of the Handbook of Graph Theory., 2003

2002
Superconnected digraphs and graphs with small conditional diameters.
Networks, 2002

2000
Fault-tolerant routings in chordal ring networks.
Networks, 2000

Edge-Bisection of Chordal Rings.
Proceedings of the Mathematical Foundations of Computer Science 2000, 2000

1999
On the superconnectivity and the conditional diameter of graphs and digraphs.
Networks, 1999

Superconnectivity of bipartite digraphs and graphs.
Discret. Math., 1999

1997
Extraconnectivity of graphs with large minimum degree and girth.
Discret. Math., 1997

On the order and size of s-geodetic digraphs with given connectivity.
Discret. Math., 1997

Connectivity of large bipartite digraphs and graphs.
Discret. Math., 1997

Fault-tolerant Routings in Double Fixed-step Networks.
Discret. Appl. Math., 1997

1996
On the connectivity and the conditional diameter of graphs and digraphs.
Networks, 1996

On the extraconnectivity of graphs.
Discret. Math., 1996

Bipartite Graphs and Digraphs with Maximum Connectivity.
Discret. Appl. Math., 1996

1994
On the distance connectivity of graphs and digraphs.
Discret. Math., 1994

Extraconnectivity of graphs with large girth.
Discret. Math., 1994

1993
A Unified Approach to the design and Control of Dynamic Memory Networks.
Parallel Process. Lett., 1993

1989
Maximally connected digraphs.
J. Graph Theory, 1989


  Loading...