Another characterization of hypercubes

Nous montrons que dans la classe des graphes connexes tels que deux aretes incidentes quelconques appartiennent a un et un seul quadrilatere, les hypercubes finis sont les graphes de degre minimum n fini et possedant 2^n sommets. The following theorem^1 is proved: Let C be the class connected graphs such that each pair of distinct adjacent edges lies in exactly one 4-cycle. Then G in C is a finite hypercube ifthe minimum degree @d of G is finite and^2 |V(G)| = 2^@d.