Zobrazeno 1 - 3
of 3
pro vyhledávání: '"eulerian irregularity"'
Publikováno v:
Discussiones Mathematicae Graph Theory, Vol 34, Iss 2, Pp 391-408 (2014)
A closed walk in a connected graph G that contains every edge of G exactly once is an Eulerian circuit. A graph is Eulerian if it contains an Eulerian circuit. It is well known that a connected graph G is Eulerian if and only if every vertex of G is
Externí odkaz:
https://doaj.org/article/a9ec3088d29345e7acf84b33f58db922
Publikováno v:
Discussiones Mathematicae Graph Theory, Vol 34, Iss 2, Pp 391-408 (2014)
A closed walk in a connected graph G that contains every edge of G exactly once is an Eulerian circuit. A graph is Eulerian if it contains an Eulerian circuit. It is well known that a connected graph G is Eulerian if and only if every vertex of G is
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::6e5f794362e4175136547bb3da4b3e2a
https://doi.org/10.7151/dmgt.1744
https://doi.org/10.7151/dmgt.1744
Die Theorie der regularen Graphen (The Theory of Regular Graphs), written by the Danish Mathematician Julius Petersen in 1891, is often considered the first strictly theoretical paper dealing with graphs. In the 130 years since then, regular graphs
