Minimum Level Nonplanar Patterns for Trees

DOI10.1007/978-3-540-77537-9_10MaRDI QIDQ5452212zbMATH OpenOpenAlexFDO

Authors J. Joseph Fowler, Stephen G. Kobourov

Publication date 25 March 2008

Published in Graph Drawing (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/978-3-540-77537-9_10

Mathematics Subject Classification ID

Graph representations (geometric and intersection representations, etc.) (05C62) Graph theory (including graph drawing) in computer science (68R10) Computer graphics; computational geometry (digital and algorithmic aspects) (68U05)

Recommendations

• On the characterization of level planar trees by minimal patterns
• Characterization of level non-planar graphs by minimal patterns
• A characterization of level planar graphs
• Characterization of Unlabeled Level Planar Trees
• Characterization of unlabeled level planar trees

Cited in

(8)

• Minimal nonstandard Coxeter trees
• Characterization of level non-planar graphs by minimal patterns
• Linear Time Planarity Testing and Embedding of Strongly Connected Cyclic Level Graphs
• On the characterization of level planar trees by minimal patterns
• Graph Simultaneous Embedding Tool, GraphSET
• Strip planarity testing for embedded planar graphs
• Colored simultaneous geometric embeddings and universal pointsets
• Characterization of unlabeled level planar trees

This page was built for publication: Minimum Level Nonplanar Patterns for Trees

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