Zobrazeno 1 - 10
of 58
pro vyhledávání: '"Gerhard, Ringel"'
Autor:
Nora Hartsfield, Gerhard Ringel
'Innovative introductory text... clear exposition of unusual and more advanced topics... Develops material to substantial level.'— American Mathematical Monthly'Refreshingly different... an ideal training ground for the mathematical process of inve
Autor:
Brad Jackson, Gerhard Ringel
Publikováno v:
Discrete Mathematics. 211(1-3):233-242
We use current graphs to find decompositions of complete graphs into subgraphs with certain embeddability properties. These decompositions provide solutions to various extensions of Ringel's earth–moon problem to other surfaces and to more than two
Autor:
Llado, Anna S., Ringel, Gerhard, Hikoe, Enomoto, Anna S., Llado, Tomoki, Nakamigawa, Gerhard, Ringel
Publikováno v:
SUT Journal of Mathematics = SUT Journal of Mathematics. 34(2):105-109
Publikováno v:
Journal of Graph Theory. 18:777-789
G. Ringel conjectured that for every positive integer n other than 2, 4, 5, 8, 9, and 16, there exists a nonseparable graph with n cycles. It is proved here that the conjecture is true even with the restriction to planar and hamiltonian graphs.
Autor:
Gerhard Ringel
Publikováno v:
Journal of Graph Theory. 17:755-758
It is proven that each maximal planar bipartite graph is decomposable into two trees. © 1993 John Wiley & Sons, Inc.
Autor:
Gerhard Ringel
Publikováno v:
JOT Journal für Oberflächentechnik. 40:44-46
Trotz eines standig wachsenden Aufwandes fur qualitatssichernde Masnahmen in der Oberflachentechnik gibt es immer wieder Schadensfalle mit den unterschiedlichsten Auswirkungen. Fur die Ursachenforschung stehen verschiedene Verfahren zur Verfugung. Na
Autor:
Hanfried Lenz, Gerhard Ringel
Publikováno v:
Discrete Mathematics. 97:3-16
Most of Egmont Kohler's papers are devoted to two main topics: 1. (I) Graph theory, in particular the factorization of a graph into isomorphic subgraphs, see [1–2, 6, 9–11] where he found the first relevant solutions of the Oberwolfach Problem. 2
Autor:
Nora Hartsfield, Gerhard Ringel
Publikováno v:
Combinatorica. 11:145-155
Autor:
Gerhard Ringel, N. Hartsfield
Publikováno v:
Discrete Mathematics. 81:19-23
The complete even k -partite graph K n1 , n2 ,…, n k is the complete k -partite graph where all the n i 's are even numbers. Orientable and nonorientable quadrangular embeddings are constructed for all these graphs.
Publikováno v:
The American Mathematical Monthly. 98:873