Planarity is an English word. Below you'll find 4 example sentences showing how it's used in practice.
Planarity in a sentence
Planarity meaning
The condition of being planar
Using Planarity
- The main meaning on this page is: The condition of being planar
- In the example corpus, planarity often appears in combinations such as: planarity testing.
Context around Planarity
- Average sentence length in these examples: 30.5 words
- Position in the sentence: 2 start, 1 middle, 1 end
- Sentence types: 4 statements, 0 questions, 0 exclamations
Corpus analysis for Planarity
- In this selection, "planarity" usually appears near the start of the sentence. The average example has 30.5 words, and this corpus slice is mostly made up of statements.
- Around the word, see, testing and criteria stand out and add context to how "planarity" is used.
- Recognizable usage signals include conditions for planarity that are and not see planarity testing. That gives this page its own corpus information beyond isolated example sentences.
- By corpus frequency, "planarity" sits close to words such as aaaaand, aaah and aaargh, which helps place it inside the broader word index.
Example types with planarity
The same corpus examples are grouped by length and sentence type, making it easier to see the contexts in which the word appears:
Other planarity criteria In practice, it is difficult to use Kuratowski's criterion to quickly decide whether a given graph is planar. (22 words)
Note that these theorems provide necessary conditions for planarity that are not sufficient conditions, and therefore can only be used to prove a graph is not planar, not that it is planar. (32 words)
This allows the correctness of a planarity testing algorithm to be verified for nonplanar inputs, as it is straightforward to test whether a given subgraph is or is not a Kuratowski subgraph. citation. (33 words)
However, there exist fast algorithms for this problem: for a graph with n vertices, it is possible to determine in time (n) (linear time) whether the graph may be planar or not (see planarity testing ). (35 words)
This allows the correctness of a planarity testing algorithm to be verified for nonplanar inputs, as it is straightforward to test whether a given subgraph is or is not a Kuratowski subgraph. citation. (33 words)
Note that these theorems provide necessary conditions for planarity that are not sufficient conditions, and therefore can only be used to prove a graph is not planar, not that it is planar. (32 words)
Example sentences (4)
However, there exist fast algorithms for this problem: for a graph with n vertices, it is possible to determine in time (n) (linear time) whether the graph may be planar or not (see planarity testing ).
Note that these theorems provide necessary conditions for planarity that are not sufficient conditions, and therefore can only be used to prove a graph is not planar, not that it is planar.
Other planarity criteria In practice, it is difficult to use Kuratowski's criterion to quickly decide whether a given graph is planar.
This allows the correctness of a planarity testing algorithm to be verified for nonplanar inputs, as it is straightforward to test whether a given subgraph is or is not a Kuratowski subgraph. citation.
Common combinations with planarity
These word pairs occur most frequently in English texts: