Skip to search formSkip to main contentSkip to account menu

Planar graph

Known as: Pontryagin-Kuratowski theorem, Planer graph, Planar embedding of the graph 
In graph theory, a planar graph is a graph that can be embedded in the plane, i.e., it can be drawn on the plane in such a way that its edges… 
Wikipedia (opens in a new tab)

Related topics

Related topics

50 relations
Angular resolution (graph drawing)Bidiakis cubeCircuit rankCograph

Papers overview

Semantic Scholar uses AI to extract papers important to this topic.
Highly Cited
2012
Highly Cited
2012
Side Chain Engineering of Polythiophene Derivatives with a Thienylene–Vinylene Conjugated Side Chain for Application in Polymer Solar Cells
Two new conjugated side-chain isolated polythiophene derivatives, PT4TV and PT4TV-C, were designed and synthesized by… 
Review
2011
Review
2011
A Survey on Geographic Routing Protocols for Mobile Ad hoc Networks
Geographic routing has become one of the most suitable routing strategies in wireless mobile ad hoc network mainly due to its… 
Highly Cited
2004
Highly Cited
2004
Design and analysis of planar monopole antennas using a genetic algorithm approach
The application of genetic algorithm (GA) optimization to the design and analysis of planar monopole antennas is presented. GA is… 
Highly Cited
2001
Highly Cited
2001
Density functional study of guanine and uracil quartets and of guanine quartet/metal ion complexes
The structures and interaction energies of guanine and uracil quartets have been determined by B3LYP hybrid density‐functional… 
Highly Cited
1997
Highly Cited
1997
Effect of interface undulations on the thermal fatigue of thin films and scales on metal substrates
Highly Cited
1992
Highly Cited
1992
Hierarchical triangulation using cartographic coherence
Highly Cited
1989
Highly Cited
1989
Modal Theorem Proving: An Equational Viewpoint
We propose a new method for automated theorem proving in first order modal logic. Essentially, the method consists in a… 
Highly Cited
1988
Highly Cited
1988
Covering orthogonal polygons with star polygons: the perfect graph approach
We consider the problem of covering simple orthogonal polygons with star polygons. A star polygon contains a point <italic>p… 
Highly Cited
1984
Highly Cited
1984
Polyhedral approximation of 3-D objects without holes
Highly Cited
1977
Highly Cited
1977
Ab initio calculations of the equilibrium structure of cyclobutane
The equilibrium structure of cyclobutane has been calculated by single determinant restricted Hartree-Fock theory using an… 
By clicking accept or continuing to use the site, you agree to the terms outlined in our Privacy Policy (opens in a new tab), Terms of Service (opens in a new tab), and Dataset License (opens in a new tab)