Metadata
Author: WikiMatrix
Data
English[en]
In graph theory, a part of discrete mathematics, the BEST theorem gives a product formula for the number of Eulerian circuits in directed (oriented) graphs.
Swedish[sv]
I grafteori, en del av den diskreta matematiken, ger BEST-teoremet en produktformel för antalet Eulerkretsar hos en riktad graf.