A Linear-Time Algorithm to Find Four Independent Spanning Trees in Four-Connected Planar Graphs.

Kazuyuki Miura, Daishiro Takahashi, Shin-Ichi Nakano, Takao Nishizeki

Browse the full WG paper archive.