Characterization of level non-planar graphs by minimal patterns

DOI10.1007/3-540-44968-X_8MaRDI QIDQ2766816zbMATH OpenFDO

Authors Patrick Healy, Ago Kuusik, Sebastian Leipert

Publication date 22 July 2002

Published in Lecture Notes in Computer Science (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/3-540-44968-X_8

Mathematics Subject Classification ID

Graph algorithms (graph-theoretic aspects) (05C85) Computer graphics; computational geometry (digital and algorithmic aspects) (68U05)

Recommendations

• A characterization of level planar graphs
• Minimum Level Nonplanar Patterns for Trees
• On the characterization of level planar trees by minimal patterns
• Characterization of Unlabeled Level Planar Graphs
• Characterization of Unlabeled Level Planar Trees

Cited in

(5)

• A characterization of level planar graphs
• On the characterization of level planar trees by minimal patterns
• Minimum Level Nonplanar Patterns for Trees
• Colored simultaneous geometric embeddings and universal pointsets
• Algorithms for multi-level graph planarity testing and layout

This page was built for publication: Characterization of level non-planar graphs by minimal patterns

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