1 citations · 1 across the 2 of their papers we have counts for
4 papers
Bipartite biregular Moore graphs
Gabriela Araujo-Pardo, Cristina Dalfó, Miguel Ángel Fiol +1
A bipartite graph with is biregular if all the vertices of a stable set have the same degree for . In this paper, we give an improved n…
New results for the Mondrian art problem
C. Dalfó, M. A. Fiol, N. López
The Mondrian problem consists of dissecting a square of side length $n\in \NN$ into non-congruent rectangles with natural length sides such that the difference between the l…
Network reliability in hamiltonian graphs
Pol Llagostera, Nacho López, Carles Comas
The reliability polynomial of a graph gives the probability that a graph remains operational when all its edges could fail independently with a certain fixed probability. In genera…
On new record graphs close to bipartite Moore graphs
Gabriela Araujo-Pardo, Nacho López
The modelling of interconnection networks by graphs motivated the study of several extremal problems that involve well known parameters of a graph (degree, diameter, girth and orde…