Sbihi earned a degree from the Faculty of Sciences of Mohammed V University in Rabat, Morocco in 1973.
She continued her studies in France at Joseph Fourier University in Grenoble, first in computer science in which she earned a bachelor's degree in 1975.
Continuing in operations research, she earned a diplôme d'études approfondies in 1976,[2] a doctorat de troisième cycle in 1978 under the supervision of Michel Sakarovitch,[1] and a doctorat d'état in 1987, supervised by Jean Fonlupt.
[B] Their work in this area introduced a type of graph decomposition that was central to the eventual proof of the full strong perfect graph theorem.
[4] She and Chvátal also devised efficient algorithms for recognizing the claw-free perfect graphs,[C] and later she and Bruce Reed showed how to recognize the Bull-free perfect graphs.