Minimum level nonplanar patterns for trees

J. Joseph Fowler; Stephen G. Kobourov

doi:10.1007/978-3-540-77537-9_10

Minimum level nonplanar patterns for trees

J. Joseph Fowler, Stephen G. Kobourov

Computer Science

Research output: Chapter in Book/Report/Conference proceeding › Conference contribution

10 Scopus citations

Abstract

Minimum Level Nonplanar (MLNP) patterns play the role for level planar graphs that the forbidden Kuratowksi subdivisions K ₅ 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 language	English (US)
Title of host publication	Graph Drawing - 15th International Symposium, GD 2007, Revised Papers
Pages	69-75
Number of pages	7
DOIs	https://doi.org/10.1007/978-3-540-77537-9_10
State	Published - 2008
Event	15th International Symposium on Graph Drawing, GD 2007 - Sydney, Australia Duration: Sep 24 2007 → Sep 26 2007

Publication series

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

Other

Other	15th International Symposium on Graph Drawing, GD 2007
Country/Territory	Australia
City	Sydney
Period	9/24/07 → 9/26/07

ASJC Scopus subject areas

Theoretical Computer Science
General Computer Science

Access to Document

10.1007/978-3-540-77537-9_10

Cite this

Minimum level nonplanar patterns for trees. / Fowler, J. Joseph; Kobourov, Stephen G.
Graph Drawing - 15th International Symposium, GD 2007, Revised Papers. 2008. p. 69-75 (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics); Vol. 4875 LNCS).

Research output: Chapter in Book/Report/Conference proceeding › Conference contribution

Fowler, JJ & Kobourov, SG 2008, Minimum level nonplanar patterns for trees. in Graph Drawing - 15th International Symposium, GD 2007, Revised Papers. Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics), vol. 4875 LNCS, pp. 69-75, 15th International Symposium on Graph Drawing, GD 2007, Sydney, Australia, 9/24/07. https://doi.org/10.1007/978-3-540-77537-9_10

@inproceedings{96beab698ad941c38b6dca9571e279fa,

title = "Minimum level nonplanar patterns for trees",

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.",

author = "Fowler, {J. Joseph} and Kobourov, {Stephen G.}",

year = "2008",

doi = "10.1007/978-3-540-77537-9_10",

language = "English (US)",

isbn = "3540775366",

series = "Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)",

pages = "69--75",

booktitle = "Graph Drawing - 15th International Symposium, GD 2007, Revised Papers",

note = "15th International Symposium on Graph Drawing, GD 2007 ; Conference date: 24-09-2007 Through 26-09-2007",

}

TY - GEN

T1 - Minimum level nonplanar patterns for trees

AU - Fowler, J. Joseph

AU - Kobourov, Stephen G.

PY - 2008

Y1 - 2008

N2 - 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.

AB - 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.

UR - http://www.scopus.com/inward/record.url?scp=49949104102&partnerID=8YFLogxK

UR - http://www.scopus.com/inward/citedby.url?scp=49949104102&partnerID=8YFLogxK

U2 - 10.1007/978-3-540-77537-9_10

DO - 10.1007/978-3-540-77537-9_10

M3 - Conference contribution

AN - SCOPUS:49949104102

SN - 3540775366

SN - 9783540775362

T3 - Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)

SP - 69

EP - 75

BT - Graph Drawing - 15th International Symposium, GD 2007, Revised Papers

T2 - 15th International Symposium on Graph Drawing, GD 2007

Y2 - 24 September 2007 through 26 September 2007

ER -

Minimum level nonplanar patterns for trees

Abstract

Publication series

Other

ASJC Scopus subject areas

Access to Document

Other files and links

Fingerprint

Cite this