Mutual witness Gabriel drawings of complete bipartite graphs

DOI10.1016/j.tcs.2023.114115OpenAlexW4385651155MaRDI QIDQ6073652

William J. Lenhart, Giuseppe Liotta

Publication date: 18 September 2023

Published in: Theoretical Computer Science (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.tcs.2023.114115

zbMATH Keywords

Gabriel drawingsproximity drawingssimultaneous drawing of two graphswitness proximity drawings

Mathematics Subject Classification ID

Theory of computing (68Qxx)

Cites Work

• Unnamed Item
• Unnamed Item
• Witness Gabriel graphs
• Lower bounds on the obstacle number of graphs
• Witness (Delaunay) graphs
• On the structure of graphs with low obstacle number
• Witness rectangle graphs
• Obstacle numbers of graphs
• The relative neighborhood graph for mixed feature variables
• Drawing graphs using a small number of obstacles
• Mutual witness proximity graphs
• On obstacle numbers
• Obstructing Visibilities with One Obstacle
• Graphs with Large Obstacle Numbers
• Simultaneous Embedding
• Shape-Based Quality Metrics for Large Graph Visualization

This page was built for publication: Mutual witness Gabriel drawings of complete bipartite graphs