Beweis einer Abschwächung der Hadwiger-Vermutung

From MaRDI portal
Revision as of 04:50, 3 February 2024 by Import240129110113 (talk | contribs) (Created automatically from import240129110113)
(diff) ← Older revision | Latest revision (diff) | Newer revision → (diff)

Publication:2538210

DOI10.1007/BF01361181zbMath0192.30002OpenAlexW2010900677MaRDI QIDQ2538210

No author found.

Publication date: 1964

Published in: Mathematische Annalen (Search for Journal in Brave)

Full work available at URL: https://eudml.org/doc/161124




Related Items (33)

The monadic second order logic of graphs. VI: On several representations of graphs by relational structuresOn a new reformulation of Hadwiger's conjectureConstructing Graphs with No Immersion of Large Complete GraphsNew algorithms for the weighted maximum cut problem on graphsAnwendung einer Methode von K. Wagner bei Färbungsproblemen für GraphenThe max-cut problem on graphs not contractible to \(K_ 5\)Some recent progress and applications in graph minor theoryDecomposition of regular matroidsCliques in dense GF(\(q\))-representable matroidsOn Tutte's extension of the four-colour problemÜber endliche Graphen mit vorgegebenen Homomorphieeigenschaften. (On finite graphs with prescribed homotopy properties)Complete graph immersions in dense graphsOn the notion of generalized minor in topological network theory and matroidsOn cuts and matchings in planar graphsOn the structure of \(k\)-connected graphs without \(K_{k}\)-minorOn the chromatic number of binary matroidsS-functions for graphsGraph theoryContractions of graphs: A theorem of Ore and an extremal problemColouring problemsZur Klassifikation der endlichen Graphen nach H. Hadwiger und K. WagnerUnterteilungen vollständiger Graphen in Graphen mit unendlicher chromatischer ZahlHadwiger number and the Cartesian product of graphsHomomorphieeigenschaften und mittlere Kantendichte von GraphenHadwiger’s ConjectureLinear connectivity forces large complete bipartite minorsLower bound of the Hadwiger number of graphs by their average degreeWohlquasigeordnete Klassen endlicher GraphenSurfaces, tree-width, clique-minors, and partitionsThe extremal function for complete minorsOn Vertex Partitions and the Colin de Verdière ParameterKlaus Wagner 1910-2000Homomorphisms of Signed Graphs




This page was built for publication: Beweis einer Abschwächung der Hadwiger-Vermutung