In graph theory, Kuratowski's theorem is a mathematical forbidden graph characterization of planar graphs, named after Kazimierz Kuratowski. Itâ€¦Â (More)

Semantic Scholar uses AI to extract papers important to this topic.

2015

2015

- Archontia C. Giannopoulou, Marcin Kaminski, Dimitrios M. Thilikos
- Journal of Graph Theory
- 2015

The immersion relation is a partial ordering relation on graphs that is weaker than the topological minor relation in the senseâ€¦Â (More)

Is this relevant?

2009

2009

- Janusz A. Brzozowski, Elyot Grant, Jeffrey Shallit
- Developments in Language Theory
- 2009

A famous theorem of Kuratowski states that in a topological space, at most 14 distinct sets can be produced by repeatedlyâ€¦Â (More)

Is this relevant?

2000

2000

- Dainis Zeps
- 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)

Is this relevant?

1998

1998

- Dainis Zeps
- 1998

Free-minor closed classes [2] and free-planar graphs [3] are considered. Versions of Kuratowski-like theorem for free-planarâ€¦Â (More)

Is this relevant?

1990

1990

- Neil Robertson, Paul D. Seymour
- J. Comb. Theory, Ser. B
- 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

- Carsten Thomassen
- J. Comb. Theory, Ser. B
- 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)

Is this relevant?

Highly Cited

1981

Highly Cited

1981

- Dan Archdeacon
- Journal of Graph Theory
- 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

- Carsten Thomassen
- Journal of Graph Theory
- 1981

Planar graphs are of great importance in graph theory. They are interesting in their own right and their chromatic, enumerativeâ€¦Â (More)

Is this relevant?

1970

1970

- Peng-Siu Mei, Norman E. Gibbs
- AFIPS Spring Joint Computing Conference
- 1970

In the layout of integrated circuits and printed circuits, one often wants to know if a particular electrical network is planarâ€¦Â (More)

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)

Is this relevant?