scientific article; zbMATH DE number 3891393

From MaRDI portal
Publication:3347904





[For the entire collection see Zbl 0546.00007.] From the author's summary: Two of the main Galois theoretic results, namely a fundamental theorem and a solvability criterion, are derived for trees. This Galois theory of trees arose from investigations into the complexity of algorithmic problems. It points to the possibility of similarly considering more general classes of graphs.











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 Q3347904)