Über eine Eigenschaft der ebenen Komplexe

1937/12/01 by K. Wagner, Klaus W. Wagner · 23 citations
Mathematics · #Advanced Topics in Algebra #Humanities #Mathematics #Philosophy

paper · doi:10.1007/bf01594196

crossref issued 1937/12/01 · crossref published 1937/12/01 · crossref published-print 1937/12/01 · openalex publication_date 1937/12/01 · crossref created 2005/04/28 · crossref deposited 2019/05/03 · openalex created_date 2025/10/10 · crossref indexed 2026/07/20 · openalex updated_date 2026/07/23

Cited by

• Grad and classes with bounded expansion II. Algorithmic aspects
• A characterization of terminal planar networks by forbidden structures
• The Nature of Computation
• Neural Algorithmic Reasoning for Approximate k-Coloring with Recursive Warm Starts
• S-functions for graphs
• Spectra of Graphs
• Nonconstructive tools for proving polynomial-time decidability
• 1.5-Approximation for Treewidth of Graphs Excluding a Graph with One Crossing as a Minor
• Graph Minors. XVI. Excluding a non-planar graph
• On the odd-minor variant of Hadwiger's conjecture
• Graph minor theory
• Bipartite minors
• Progress on perfect graphs
• A directed flat wall theorem excluding a crossrow grid
• Constructive results from graph minors: linkless embeddings
• Note on coloring graphs without odd-Kk-minors
• Reducing Hajós' 4-coloring conjecture to 4-connected graphs
• Any 7-Chromatic Graphs Has K 7 Or K 4,4 As A Minor
• Disproof of the List Hadwiger Conjecture
• Graph minor [wikipedia]
• Hadwiger conjecture (graph theory) [wikipedia]
• Hadwiger number [wikipedia]
• Planar graph [wikipedia]