Minimum level nonplanar patterns for trees

J. Joseph Fowler, Stephen G. Kobourov

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

8 Scopus citations

Abstract

Minimum Level Nonplanar (MLNP) patterns play the role for level planar graphs that the forbidden Kuratowksi subdivisions K 5 and K 3,3 play for planar graphs. We add two (MLNP) patterns for trees to the previous set of tree patterns given by Healy et al. [4]. Neither of these patterns match any of the previous patterns. We show that this new set of patterns completely characterizes level planar trees.

Original languageEnglish (US)
Title of host publicationGraph Drawing - 15th International Symposium, GD 2007, Revised Papers
Pages69-75
Number of pages7
DOIs
StatePublished - Aug 27 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

Other

Other15th International Symposium on Graph Drawing, GD 2007
CountryAustralia
CitySydney
Period9/24/079/26/07

ASJC Scopus subject areas

  • Theoretical Computer Science
  • Computer Science(all)

Fingerprint Dive into the research topics of 'Minimum level nonplanar patterns for trees'. Together they form a unique fingerprint.

  • Cite this

    Fowler, J. J., & Kobourov, S. G. (2008). Minimum level nonplanar patterns for trees. In Graph Drawing - 15th International Symposium, GD 2007, Revised Papers (pp. 69-75). (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics); Vol. 4875 LNCS). https://doi.org/10.1007/978-3-540-77537-9_10