Bemerkungen zu Hadwigers Vermutung

DOI10.1007/BF01360256zbMATH Open0096.17904MaRDI QIDQ773174FDOQ773174

Authors: Klaus Wagner 

Publication date: 1960

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

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

zbMATH Keywords

topology

Cites Work

• A Property of 4-Chromatic Graphs and some Remarks on Critical Graphs
• Bemerkungen zum Vierfarbenproblem
• The structure of k-chromatic graphs
• Title not available (Why is that?)
• A Theorem of R. L. Brooks and a Conjecture of H. Hadwiger

Cited In (41)

• Über einen Satz von K.Wagner zum Vierfarbenproblem
• Primität und Homomorphie von ebenen Dreiecksgraphen
• Kempe classes and the Hadwiger conjecture
• Connected max cut is polynomial for graphs without the excluded minor \(K_5\backslash e\)
• Klaus Wagner 1910-2000
• Wohlquasigeordnete Klassen endlicher Graphen
• Unterteilungen vollständiger Graphen in Graphen mit unendlicher chromatischer Zahl
• Clique-sums, tree-decompositions and compactness
• On a composition of independence systems by circuit identification
• Über trennende Eckenmengen in homomorphiekritischen Graphen
• A decomposition theory for matroids. IV: Decomposition of graphs
• Omomorfismi fra grafi e grafi moltiplicativi
• A counter-example to ‘Wagner's conjecture’ for infinite graphs
• Graphs with forbidden subgraphs
• Homomorphiesätze für Graphen
• Colouring problems
• Bemerkungen über ebene Graphen
• A note on partial 3-trees and homomorphism bases of graphs
• Über Minimalstrukturen von Graphen, insbesondere von n-fach zusammenhängenden Graphen
• Minimal acyclic forbidden minors for the family of graphs with bounded path-width
• On the choosability of \(H\)-minor-free graphs
• S-functions for graphs
• Universal graphs with forbidden wheel minors
• Simplicial decompositions of graphs: A survey of applications
• A contraction theorem for abstract graphs
• Coloring algorithms for \(K_ 5\)-minor free graphs
• The Ulam number of infinite graphs
• Zur Klassifikation der endlichen Graphen nach H. Hadwiger und K. Wagner
• Connected cutsets of a graph and triangle bases of the cycle space
• Generating internally four-connected graphs
• Eine Klasse minimaler, nicht plättbarer Graphen
• An advance in infinite graph models for the analysis of transportation networks
• On bases of the set of graphs with given coefficient of internal stability
• Decomposing infinite graphs
• NC algorithms for computing the number of perfect matchings in \(K_{3,3}\)-free graphs and related problems
• A characterization of some graph classes using excluded minors
• A case of Hadwiger's conjecture
• Über endliche Graphen mit vorgegebenen Homomorphieeigenschaften. (On finite graphs with prescribed homotopy properties)
• Homomorphism theorems for graphs
• On the bond polytope
• A min-max relation for \(K_ 3\)-covers in graphs noncontractible to \(K_ 5\backslash e\)

This page was built for publication: Bemerkungen zu Hadwigers Vermutung

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q773174)