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…

Papers overview

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

2018

This manuscript extends the Cantor-Kuratowski intersection theorem from the setting of metric spaces to the setting of…

2017

A s the title suggests the main aim of this paper is to study electrical network/circuit diagrams in term of graphs and…

2012

Linear-time algorithms for testing the planarity of a graph are well known for over 35 years. However, these algorithms are quite…

2011

In the last years, several integer linear programming (ILP) formulations for the crossing number problem arose. While they all…

2008

This paper deals with some results in generalized convex spaces. The notion of minimal generalized convex space is introduced and…

2001

A graph is planar if it can be drawn on the plane with vertices at unique locations and no edge intersections. Due to the wealth…

1997

1995

本文通过放弃凸性和放松γ-对角拟凹性等条件,在H-空间中推广了Fan-Knaster-Kuratowski-Mazurkiewicz(FKKM)定理和Ky Fan…

1983

. It is the purpose of this note to further clarify the relationship between continuous images of Lusin sets and concentrated…

1977

This note discusses a relationship between planning requirements which simultaneously demand that rooms satisfy some set of…