Matched Drawability of Graph Pairs and of Graph Triples

DOI10.1007/978-3-642-00202-1_28zbMath1211.68468OpenAlexW1522697688WikidataQ62042541 ScholiaQ62042541MaRDI QIDQ3605508

Luca Grilli, Giuseppe Liotta, Seok-Hee Hong, Stephen K. Wismath, Henk G. Meijer

Publication date: 24 February 2009

Published in: WALCOM: Algorithms and Computation (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/978-3-642-00202-1_28

Mathematics Subject Classification ID

Graph theory (including graph drawing) in computer science (68R10) Computer graphics; computational geometry (digital and algorithmic aspects) (68U05)

Related Items (1)

Matched drawability of graph pairs and of graph triples

Cites Work

• Unnamed Item
• Unnamed Item
• On simultaneous planar graph embeddings
• Matched drawability of graph pairs and of graph triples
• Characterization of Unlabeled Level Planar Trees
• Graph Drawing and Applications for Software and Knowledge Engineers
• Characterization of Unlabeled Level Planar Graphs
• Matched Drawings of Planar Graphs
• Constrained Simultaneous and Near-Simultaneous Embeddings
• Graph Drawing
• Drawing graphs. Methods and models

This page was built for publication: Matched Drawability of Graph Pairs and of Graph Triples