Two trees which are self-intersecting when drawn simultaneously

DOI10.1016/j.disc.2008.01.033zbMath1170.05023OpenAlexW2052116986MaRDI QIDQ1011769

Michael Kaufmann, Markus Geyer, Imrich Vrt'o

Publication date: 9 April 2009

Published in: Discrete Mathematics (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.disc.2008.01.033

zbMATH Keywords

graph drawinggeometric thicknesssimultaneous embeddings

Mathematics Subject Classification ID

Trees (05C05) Planar graphs; geometric and topological aspects of graph theory (05C10)

Related Items (8)

SIMULTANEOUS EMBEDDING OF EMBEDDED PLANAR GRAPHS ⋮ On graph thickness, geometric thickness, and separator theorems ⋮ On the curve complexity of 3-colored point-set embeddings ⋮ Testing the simultaneous embeddability of two graphs whose intersection is a biconnected or a connected graph ⋮ Testing the Simultaneous Embeddability of Two Graphs Whose Intersection Is a Biconnected Graph or a Tree ⋮ Computing upward topological book embeddings of upward planar digraphs ⋮ Simultaneous Embeddings with Few Bends and Crossings ⋮ Matched drawability of graph pairs and of graph triples

Cites Work

• Unnamed Item
• The geometric thickness of low degree graphs
• Graph Drawing
• Graph Drawing
• Algorithms and Data Structures

This page was built for publication: Two trees which are self-intersecting when drawn simultaneously