6 citations · 7 across the 4 of their papers we have counts for
Showing 2020Show all
3 papers · 1 filter
math.CO2020★ 1 cited
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…
math.CO2020
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…
math.CO2020
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…