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

Kazuyuki Miura, Daishiro Takahashi, Shin-Ichi Nakano, Takao Nishizeki. A Linear-Time Algorithm to Find Four Independent Spanning Trees in Four Connected Planar Graphs. Int. J. Found. Comput. Sci., 10(2):195-210, 1999.

Abstract

Abstract is missing.