Characterization of unlabeled level planar graphs

J. Joseph Fowler, Stephen G. Kobourov

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

20 Scopus citations


We present the set of planar graphs that always have a simultaneous geometric embedding with a strictly monotone path on the same set of n vertices, for any of the n! possible mappings. These graphs are equivalent to the set of unlabeled level planar (ULP) graphs that are level planar over all possible labelings. Our contributions are twofold. First, we provide linear time drawing algorithms for ULP graphs. Second, we provide a complete characterization of ULP graphs by showing that any other graph must contain a subgraph homeomorphic to one of seven forbidden graphs.

Original languageEnglish (US)
Title of host publicationGraph Drawing - 15th International Symposium, GD 2007, Revised Papers
Number of pages13
StatePublished - 2008
Event15th International Symposium on Graph Drawing, GD 2007 - Sydney, Australia
Duration: Sep 24 2007Sep 26 2007

Publication series

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


Other15th International Symposium on Graph Drawing, GD 2007

ASJC Scopus subject areas

  • Theoretical Computer Science
  • General Computer Science


Dive into the research topics of 'Characterization of unlabeled level planar graphs'. Together they form a unique fingerprint.

Cite this