Characterization of Unlabeled Level Planar Graphs

DOI10.1007/978-3-540-77537-9_7MaRDI QIDQ5452208zbMATH 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_7

Mathematics Subject Classification ID

Graph algorithms (graph-theoretic aspects) (05C85) 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)

Recommendations

• Characterization of Unlabeled Level Planar Trees
• Characterization of unlabeled level planar trees
• Characterization of unlabeled radial level planar graphs (extended abstract)
• A characterization of level planar graphs
• Level Planar Embedding in Linear Time

Cited in

(12)

• Simultaneous graph embedding with bends and circular arcs
• scientific article; zbMATH DE number 1696624 (Why is no real title available?)
• Matched drawability of graph pairs and of graph triples
• Quasi-planar Graphs
• A characterization of level planar graphs
• Characterization of Unlabeled Level Planar Trees
• Vertex angle and crossing angle resolution of leveled tree drawings
• Characterization of unlabeled level planar trees
• Characterizations of restricted pairs of planar graphs allowing simultaneous embedding with fixed edges
• Matched Drawability of Graph Pairs and of Graph Triples
• Characterization of unlabeled radial level planar graphs (extended abstract)
• Colored anchored visibility representations in 2D and 3D space

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

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