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