Planar Graphs

Santosh Kumar Yadav ()
Additional contact information
Santosh Kumar Yadav: Shri Jagdishprasad Jhabarmal Tibrewala University

Chapter Chapter 12 in Discrete Mathematics with Graph Theory, 2023, pp 521-543 from Springer

Abstract: Abstract In Graph Theory, a planar graph is a graph which can be embedded in the plane i.e., it can be drawn on the plane in such a manner that its edges intersect only at their endpoints. A planar graph which has already drawn in the plane without edge intersection is called a plane graph or planar embedding of the graph. A plane graph can be defined as a planar graph with a mapping from every node to a point in 2D space, and from every edge to a pane curve, such that the extreme points of each curve are the points mapped from its end nodes, and all the curves are disjoint except on their extreme points. Plane graphs can be encoded by combinatorial maps.

Date: 2023
References: Add references at CitEc
Citations:

There are no downloads for this item, see the EconPapers FAQ for hints about obtaining it.

Related works:
This item may be available elsewhere in EconPapers: Search for items with the same title.

Export reference: BibTeX RIS (EndNote, ProCite, RefMan) HTML/Text

Persistent link: https://EconPapers.repec.org/RePEc:spr:sprchp:978-3-031-21321-2_12

Ordering information: This item can be ordered from
http://www.springer.com/9783031213212

DOI: 10.1007/978-3-031-21321-2_12

Access Statistics for this chapter

More chapters in Springer Books from Springer
Bibliographic data for series maintained by Sonal Shukla () and Springer Nature Abstracting and Indexing ().