neplanárnost
Neplanárnost, also known as non-planarity, is a concept in graph theory, a branch of mathematics. It refers to the property of a graph that cannot be drawn on a plane without any edges crossing. A graph is planar if it can be represented as a drawing in the plane such that no edges intersect except at their endpoints. This concept is fundamental in understanding the structure and properties of graphs.
The study of planarity began with the Four Color Theorem, which states that any map can be
Kuratowski's Theorem provides a characterization of planar graphs. It states that a graph is non-planar if and
Non-planarity has applications in various fields, including computer science, where it is used in algorithms for