Characterization of Unlabeled Level Planar Trees

DOI10.1007/978-3-540-70904-6_35MaRDI QIDQ3595451zbMATH OpenOpenAlexFDO

Authors Alejandro Estrella-Balderrama, J. Joseph Fowler, Stephen G. Kobourov

Publication date 28 August 2007

Published in Graph Drawing (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/978-3-540-70904-6_35

Mathematics Subject Classification ID

Trees (05C05) Planar graphs; geometric and topological aspects of graph theory (05C10) Graph algorithms (graph-theoretic aspects) (05C85) Graph theory (including graph drawing) in computer science (68R10) Computer graphics; computational geometry (digital and algorithmic aspects) (68U05)

Recommendations

• Characterization of unlabeled level planar trees
• Characterization of Unlabeled Level Planar Graphs
• Characterization of unlabeled radial level planar graphs (extended abstract)
• On the characterization of level planar trees by minimal patterns
• A characterization of level planar graphs

Cited in

(11)

• scientific article; zbMATH DE number 1696624 (Why is no real title available?)
• Levels of a scale-free tree
• On the characterization of level planar trees by minimal patterns
• Characterization of unlabeled radial level planar graphs (extended abstract)
• Matched Drawability of Graph Pairs and of Graph Triples
• Graph Simultaneous Embedding Tool, GraphSET
• Characterization of Unlabeled Level Planar Graphs
• Minimum Level Nonplanar Patterns for Trees
• Characterizations of restricted pairs of planar graphs allowing simultaneous embedding with fixed edges
• Characterization of unlabeled level planar trees
• Simultaneous graph embedding with bends and circular arcs

This page was built for publication: Characterization of Unlabeled Level Planar Trees

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3595451)