A linear time algorithm to nd four independent spanning trees in four-connected planar graphs (1999)

by K Miura, D Takahashi, S Nakano, T Nishizeki
Venue:International Journal of Foundations of Computer Science