Is it possible to implement a breadth-first traversal of a graph recursively?

Question

Algorithms

Depth-traversal of a graph is quite simple to implement recursively , because recursion expansion and collapse is similar to working with a stack, which is the basis of depth-traversal.
Is it possible to implement a breadth-wise traversal of a graph recursively and how expedient is this? Or is it only possible to iteratively based on the queue?