Kuratowski's theorem

Known as: Kuratowski theorem 
In graph theory, Kuratowski's theorem is a mathematical forbidden graph characterization of planar graphs, named after Kazimierz Kuratowski. It… (More)
Wikipedia

Topic mentions per year

Topic mentions per year

1963-2017
051019632017

Papers overview

Semantic Scholar uses AI to extract papers important to this topic.
2015
2015
The immersion relation is a partial ordering relation on graphs that is weaker than the topological minor relation in the sense… (More)
  • figure 1
  • figure 2
  • figure 3
  • figure 4
  • figure 5
Is this relevant?
2009
2009
A famous theorem of Kuratowski states that in a topological space, at most 14 distinct sets can be produced by repeatedly… (More)
  • table 1
  • figure 1
  • table 2
Is this relevant?
2000
2000
Proof. Let us assume that G is planar but not free planar. Then there exists an edge xy not belonging to the graph whom adding to… (More)
  • figure 1
  • figure 2
Is this relevant?
1998
1998
Free-minor closed classes [2] and free-planar graphs [3] are considered. Versions of Kuratowski-like theorem for free-planar… (More)
  • figure 1
  • figure 2
  • figure 3
  • figure 4
  • figure 5
Is this relevant?
1990
1990
Kuratowski’s famous theorem of 1930 [6] asserts that a graph is planar if and only if it does not topologically contain K5 or K3… (More)
Is this relevant?
1984
1984
It is a well-known result of Dirac [2] that any graph of minimum degree at least 3 contains a subdivision of K,. Thomassen and… (More)
  • figure 1
  • figure 2
  • figure 3
  • figure 4
  • figure 5
Is this relevant?
Highly Cited
1981
Highly Cited
1981
An embedding of a graph G into a surface S is a realization of G as a subspace of S . A graph G is irreducible for S if G does… (More)
Is this relevant?
1981
1981
Planar graphs are of great importance in graph theory. They are interesting in their own right and their chromatic, enumerative… (More)
  • figure 1
  • figure 3
Is this relevant?
1970
1970
In the layout of integrated circuits and printed circuits, one often wants to know if a particular electrical network is planar… (More)
  • figure 3
  • figure 4
Is this relevant?
Highly Cited
1963
Highly Cited
1963
  • By W. T. TUTTE
  • 1963
W E use the definitions of (11). However, in deference to some recent attempts to unify the terminology of graph theory we… (More)
  • figure 1
  • figure 2
  • figure 6
  • figure 8
Is this relevant?