Regular edge labelings and drawings of planar graphs

Research output: Chapter in Book/Report/Conference proceedingConference contribution

5 Scopus citations


The problems of nicely drawing planar graphs have received increasing attention due to their broad applications [5]. A technique, regular edge labeling, was successfully used in solving several planar graph drawing problems, including visibility representation, straight-line embedding, and rectangular dual problems. A regular edge labeling of a plane graph G labels the edges of G so that the edge labels around any vertex show certain regular pattern. The drawing of G is obtained by using the combinatorial structures resulting from the edge labeling. In this paper, we survey these drawing algorithms and discuss some open problems.

Original languageEnglish (US)
Title of host publicationGraph Drawing - DIMACS International Workshop, GD 1994, Proceedings
EditorsIoannis G. Tollis, Roberto Tamassia
PublisherSpringer Verlag
Number of pages8
ISBN (Print)3540589503, 9783540589501
StatePublished - Jan 1 1995
EventDIMACS International Workshop on Graph Drawing, GD 1994 - Princeton, United States
Duration: Oct 10 1994Oct 12 1994

Publication series

NameLecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)
ISSN (Print)0302-9743
ISSN (Electronic)1611-3349


OtherDIMACS International Workshop on Graph Drawing, GD 1994
Country/TerritoryUnited States

ASJC Scopus subject areas

  • Theoretical Computer Science
  • General Computer Science


Dive into the research topics of 'Regular edge labelings and drawings of planar graphs'. Together they form a unique fingerprint.

Cite this