Matched drawability of graph pairs and of graph triples
From MaRDI portal
Publication:982951
DOI10.1016/j.comgeo.2010.03.005zbMath1195.65020OpenAlexW2016887255WikidataQ62042525 ScholiaQ62042525MaRDI QIDQ982951
Stephen K. Wismath, Giuseppe Liotta, Luca Grilli, Seok-Hee Hong, Henk G. Meijer
Publication date: 28 July 2010
Published in: Computational Geometry (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.comgeo.2010.03.005
Related Items
Cites Work
- Unnamed Item
- Unnamed Item
- On simultaneous planar graph embeddings
- Characterization of unlabeled level planar trees
- Simultaneous graph embedding with bends and circular arcs
- Two trees which are self-intersecting when drawn simultaneously
- A characterization of level planar graphs
- Matched Drawings of Planar Graphs
- Constrained Simultaneous and Near-Simultaneous Embeddings
- Visual Analysis of One-To-Many Matched Graphs
- SIMULTANEOUS EMBEDDING OF OUTERPLANAR GRAPHS, PATHS, AND CYCLES
- Embedding Graphs Simultaneously with Fixed Edges
- Matched Drawability of Graph Pairs and of Graph Triples
- Colored Simultaneous Geometric Embeddings
- Hierarchies and planarity theory
- Level Planar Embedding in Linear Time
- Graph Drawing and Applications for Software and Knowledge Engineers
- Characterizing Simultaneous Embedding with Fixed Edges
- Simultaneous Embedding of Planar Graphs with Few Bends
- Characterization of Unlabeled Level Planar Graphs
- Simultaneous Geometric Graph Embeddings
- Geometric Simultaneous Embeddings of a Graph and a Matching
- Drawing graphs. Methods and models
