Minimum Level Nonplanar Patterns for Trees

DOI10.1007/978-3-540-77537-9_10zbMATH Open1137.68485OpenAlexW1592553431MaRDI QIDQ5452212FDOQ5452212

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

Recommendations

• On the characterization of level planar trees by minimal patterns
• scientific article; zbMATH DE number 1696624
• A characterization of level planar graphs
• Characterization of Unlabeled Level Planar Trees
• Characterization of unlabeled level planar trees

Mathematics Subject Classification ID

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

Cited In (8)

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

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)