On Boolean characterizations of planarity and planar embeddings of graphs (Q2276969): Difference between revisions
From MaRDI portal
ReferenceBot (talk | contribs) Changed an Item |
Set OpenAlex properties. |
||
Property / full work available at URL | |||
Property / full work available at URL: https://doi.org/10.1007/bf02216821 / rank | |||
Normal rank | |||
Property / OpenAlex ID | |||
Property / OpenAlex ID: W2000480468 / rank | |||
Normal rank |
Latest revision as of 11:43, 30 July 2024
scientific article
Language | Label | Description | Also known as |
---|---|---|---|
English | On Boolean characterizations of planarity and planar embeddings of graphs |
scientific article |
Statements
On Boolean characterizations of planarity and planar embeddings of graphs (English)
0 references
1990
0 references
The author introduces a new planarity characterization for graphs, involving the solution of a quadratic Boolean equation. He then discusses seven combinatorially distinct configurations, called planarity obstacles, which lead to a graph whose order and size are linear functions of those of the original graph. Testing for planarity and finding a planar imbedding of the original graph can be realized algorithmically from the second graph, in linear time. A decomposition of a non-planar graph into ``T-maximal'' planar subgraphs (where T is a spanning tree) is also provided.
0 references
maximal planar subgraphs
0 references
planarity testing
0 references
planarity characterization
0 references
quadratic Boolean equation
0 references
planarity obstacles
0 references
finding a planar imbedding
0 references