Matched Drawability of Graph Pairs and of Graph Triples

DOI10.1007/978-3-642-00202-1_28MaRDI QIDQ3605508zbMATH OpenOpenAlexWikidataFDO

Authors Luca Grilli, Seok-Hee Hong, Giuseppe Liotta, Henk Meijer, S. Wismath

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)

Recommendations

• Matched drawability of graph pairs and of graph triples
• Matched Drawings of Planar Graphs
• Matched drawings of planar graphs
• Geometric simultaneous embeddings of a graph and a matching
• Geometric simultaneous embeddings of a graph and a matching

Cites work

• scientific article; zbMATH DE number 2123122 (Why is no real title available?)
• scientific article; zbMATH DE number 2123123 (Why is no real title available?)
• Characterization of Unlabeled Level Planar Graphs
• Characterization of Unlabeled Level Planar Trees
• Constrained Simultaneous and Near-Simultaneous Embeddings
• Drawing graphs. Methods and models
• Graph Drawing
• Graph Drawing and Applications for Software and Knowledge Engineers
• Matched Drawings of Planar Graphs
• Matched drawability of graph pairs and of graph triples
• On simultaneous planar graph embeddings

Cited in

(3)

• Matched drawability of graph pairs and of graph triples
• Matched drawings of planar graphs
• Matched Drawings of Planar Graphs

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

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