scientific article; zbMATH DE number 3873357

From MaRDI portal
Publication:3340879





[For the entire collection see Zbl 0534.00005.] The T-immersion of a graph G is an embedding of G in the plane, where T is a spanning tree of G and no edge e crosses any edge of T. A depth- first search algorithm with additional postprocessing for finding a T- immersion is given by a pseudo-pascal program.











This page was built for publication:

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3340879)