ScholarLens Back to search
2007•Unpublished venueRequires access

Current Research on Planar Graphs

Md. Saidur Rahman

Open publisher page 1 citations

Abstract

A graph consists of a set of vertices and a set of edges, each joining two vertices. A graph is planar if it can be embedded in the plane so that no two edges intersect geometrically except at a vertex to which they are both incident. A plane graph is a planar graph with a fixed embedding. Planar graphs have attracted computer scientists' interest due to their enormous applications, and a lot of interesting algorithms and complexity results have been obtained for planar graphs. In this talk we survey the results on planar graphs.

About this research paper

What this paper is about

A graph consists of a set of vertices and a set of edges, each joining two vertices. A graph is planar if it can be embedded in the plane so that no two edges intersect geometrically except at a vertex to which they are both incident. A plane graph is a planar graph with a fixed embedding. Planar graphs have attracted computer scientists' interest due to their enormous applications, and a lot of interesting algorithms and complexity results have been obtained for planar graphs. In this talk we survey the results on planar graphs.

Why it matters

OpenAlex reports 1 citations for this work. Citation counts describe recorded attention and do not establish research quality.

Key contribution

A contribution statement is not available in the OpenAlex record.

Method / approach

Method details are not available in the OpenAlex metadata.

Main findings

Findings are not separately available in the OpenAlex metadata.

Limitations

Limitations are not available in the OpenAlex metadata.

Applications

Application details are not available in the OpenAlex metadata.

Available abstract

A graph consists of a set of vertices and a set of edges, each joining two vertices. A graph is planar if it can be embedded in the plane so that no two edges intersect geometrically except at a vertex to which they are both incident. A plane graph is a planar graph with a fixed embedding. Planar graphs have attracted computer scientists' interest due to their enormous applications, and a lot of interesting algorithms and complexity results have been obtained for planar graphs. In this talk we survey the results on planar graphs.

Key concepts: Planar graph, Book embedding, Planar straight-line graph, Outerplanar graph, Polyhedral graph, 1-planar graph, Planar, Combinatorics

Related papers

Related paper 1Related paper 2Related paper 3
Back to paper searchBrowse research topicsOriginal source
Current Research on Planar Graphs — Research Paper | ScholarLens