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
2019
Highly Cited
2019
Planar Graphs have Bounded Queue-Number
We show that planar graphs have bounded queue-number, thus proving a conjecture of Heath, Leighton and Rosenberg from 1992. The… 
Highly Cited
2015
Highly Cited
2015
Fuzzy Planar Graphs
Fuzzy planar graph is a very important subclass of fuzzy graph. In this paper, two types of edges are mentioned for fuzzy graphs… 
Highly Cited
2014
Highly Cited
2014
Interval-valued fuzzy planar graphs
In this paper, interval-valued fuzzy planar graphs are defined and several properties are studied. The interval-valued fuzzy… 
Highly Cited
2012
Highly Cited
2012
Recurrence of planar graph limits
We prove that any distributional limit of finite planar graphs in which the degree of the root has an exponential tail is almost… 
Highly Cited
2007
Highly Cited
2007
Obtaining a Planar Graph by Vertex Deletion
In the k-Apex problem the task is to find at most k vertices whose deletion makes the given graph planar. The graphs for which… 
Highly Cited
2005
Highly Cited
2005
Multiple-source shortest paths in planar graphs
Given an <i>n</i>-node planar graph with nonnegative edge-lengths, our algorithm takes <i>O</i>(<i>n</i> log <i>n</i>) time to… 
Highly Cited
2005
Highly Cited
2005
Fixed-parameter algorithms for (k, r)-center in planar graphs and map graphs
The <i>(<i>k</i>, <i>r</i>)-center problem</i> asks whether an input graph <i>G</i> has ≤<i>k</i> vertices (called <i>centers</i… 
Highly Cited
2002
Highly Cited
2002
Completely Independent Spanning Trees in Maximal Planar Graphs
Let G be a graph. Let T1, T2, . . . , Tk be spanning trees in G. If for any two vertices u, v in G, the paths from u to v in T1… 
Highly Cited
2002
Highly Cited
2002
Planar Graphs Without Cycles of Specific Lengths
It is easy to see that planar graphs without 3-cycles are 3-degenerate. Recently, it was proved that planar graphs without 5… 
Highly Cited
1977
Highly Cited
1977
Optimal surface reconstruction from planar contours
In many scientific and technical endeavors, a three-dimensional solid must be reconstructed from serial sections, either to aid… 
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)