1990 | OriginalPaper | Buchkapitel
On the Problem of Relative Components of Minimal Graphs
verfasst von : R. Bodendiek, K. Wagner
Erschienen in: Topics in Combinatorics and Graph Theory
Verlag: Physica-Verlag HD
Enthalten in: Professional Book Archive
Aktivieren Sie unsere intelligente Suche, um passende Fachinhalte oder Patente zu finden.
Wählen Sie Textabschnitte aus um mit Künstlicher Intelligenz passenden Patente zu finden. powered by
Markieren Sie Textabschnitte, um KI-gestützt weitere passende Inhalte zu finden. powered by
1935, D.König asked the question on page 199 in his famous book with the title “Theorie der endlichen und unendlichen Graphen” whether there exists a Kuratowski-type theorem for every closed orientable surface Fp, p ∈ N0. The modern version of Kuratowski’s theorem is:The minimalbasis M1(F0) consists of exactly two graphs, the so-called Kuratowski graphs K3,3 and K5 with M1(F0) = {K3,3,K5}, where the minimalbasis M1(F0) is defined as the set of all >1-minimal graphs of the set Γ(F0) ⊂ Γ of all nonplanar graphs. Γ stands for the set of all finite undirected graphs without loops and multiple edges and >1 is the well-known subdivision relation on Γ or Γ(F0), respectively.