In Édouard Lucas publication #9, "Recherches sur l'analyse indéterminée et l'arithmétique de Diophante" on page 67 is this:
PROBLÈME IV. — Trouver trois carrés inégaux tels que la somme de deux quelconques d’entre eux diminuée du troisième, soit un carré parfait.$^1$
English translation is:
Find three unequal squares such that the sum of any two of them minus the third is a perfect square.
Lucas does not seem to give any solutions to this problem.
In the book L. E. Dickson, History of the Theory of Numbers, Volume II, Chapter XIX, section "$x^2+y^2,\, x^2+z^2,\, y^2+z^2$ ALL SQUARES", pp. $497$-$502$ on page $501$ near the top is this:
Hence $x^2+y^2 = \zeta^2, \, y^2+z^2 = \xi^2, \, z^2+x^2 = \eta^2$ for $$ x = 8rs(r^4-s^4); \qquad \xi = (r^2+s^2)^2; \qquad y,\, \zeta = (r^2-s^2)\{(r^2+s^2)^2 \mp 16r^2s^2\};\\ z,\, \eta = 2rs\{(r^2+s^2)2 \mp 4(r^2-s^2)^2\}. $$ $\qquad$ C. Leudesdorf$^{18}$ solved the equivalent system $\, 2(u^2+v^2-w^2)=x^2,\,$ $2(u^2+w^2-v^2)=y^2,\, 2(v^2+w^2-u^2)=z^2\,$ by use of trigonometric functions (cf. Gill$^{13}$). G. Heppel repeated Neuberg's$^{17}$ solution.
That is the closest reference in Dickson's book (similar but not the same because of the factors of $2$) that I could find for the problem of finding positive integer solutions to
$$ x^2+y^2-z^2 = a^2,\;\; x^2+z^2-y^2 = b^2,\;\; y^2+z^2-x^2 = c^2. $$
Since the equations are homogeneous, it is sufficient to find all integer solutions that are relatively prime. I did a small search with the results in a small table of values $\,0<x<y<z<1999$: $$\begin{array}{|c|c|c|c|c|c|} \hline x & y & z && a & b & c \\ \hline 149 & 241 & 269 && 89 & 191 & 329 \\ \hline 205 & 373 & 425 && 23 & 289 & 527 \\ \hline 397 & 593 & 707 && 97 & 553 & 833 \\ \hline 493 & 797 & 937 && 17 & 697 & 1127 \\ \hline 595 & 769 & 965 && 119 & 833 & 1081 \\ \hline \end{array}$$
Are there any parametric solutions? How to find all solutions?
As mentioned by Will Jagy in the comments, in Dickson on page $254$
$\qquad$ Welsch$^{171}$ stated that the general solution of $\,u^2 + x^2 = y^2 + z^2\,$ is $$ 2x = ab+cd, \quad 2y = ac+bd, \quad 2z = ab-cd,\quad 2u = ac-bd, $$ where $a,d$ are even, or $b,c$ are even, or all four are odd.
Very close to that is on page $252$
$\qquad$ P. Pasternak$^{152}$ proved that all solutions of $\,x^2 + y^2 = v^2 + w^2\,$ are $$ x = m\omega + np, \quad v = m\omega - np, \quad y = n\omega -mp, \quad w = n\omega + mp, $$ whence $$ x^2 + y^2 = (m^2+n^2)(\omega^2+p^2). $$
This is easily found by expressing $x^2 + y^2$ using Gaussian integers. If there was only one such equation we would be done. However, there are three such related equations and I can't see how to satisfy them all at once.
As mentioned by Will Jagy also in comments, in Dickson on pages $507$ to $509$ is the section "THREE SQUARES, SUM OF ANY TWO LESS THIRD A SQUARE" which is exactly the Lucas problem. I somehow missed the obvious. Euler gave four methods to solve the problem. Legendre and a few others are also mentioned but no mention of Lucas. The only explicit numeric solution given is the minimal $\,x=241, y=269, z=149.$
One answer to this question gives a one parameter family of solutions involving tenth degree polynomials. I would like a more simpler parametrization, perhaps with two parameters. Maybe even the complete set of solutions but that seems unlikely.