Matched Drawability of Graph Pairs and of Graph Triples

DOI10.1007/978-3-642-00202-1_28zbMATH Open1211.68468OpenAlexW1522697688WikidataQ62042541 ScholiaQ62042541MaRDI QIDQ3605508FDOQ3605508

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

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

Mathematics Subject Classification ID

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

Cites Work

• Title not available (Why is that?)
• Graph Drawing and Applications for Software and Knowledge Engineers
• Drawing graphs. Methods and models
• Title not available (Why is that?)
• On simultaneous planar graph embeddings
• Characterization of Unlabeled Level Planar Graphs
• Constrained Simultaneous and Near-Simultaneous Embeddings
• Graph Drawing
• Characterization of Unlabeled Level Planar Trees
• Matched Drawings of Planar Graphs
• Matched drawability of graph pairs and of graph triples

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)