Geodesic obstacle representation of graphs

DOI10.1016/j.comgeo.2022.101946zbMath1504.05195OpenAlexW2792606040MaRDI QIDQ2096390

Fabrizio Montecchiani, Pat Morin, Prosenjit Bose, Luís Fernando Schultz Xavier da Silveira, Paz Carmi, Saeed Mehrabi, Vida Dujmović

Publication date: 16 November 2022

Published in: Computational Geometry (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.comgeo.2022.101946

zbMATH Keywords

geodesic obstacle representationgrid obstacle representationobstacle representation

Mathematics Subject Classification ID

Extremal problems in graph theory (05C35) Paths and cycles (05C38) Planar graphs; geometric and topological aspects of graph theory (05C10) Distance in graphs (05C12) Graph representations (geometric and intersection representations, etc.) (05C62)

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Lower bounds on the obstacle number of graphs
• On the structure of graphs with low obstacle number
• Obstacle numbers of graphs
• Drawing subcubic planar graphs with four slopes and optimal angular resolution
• Drawing graphs using a small number of obstacles
• Drawing planar graphs using the canonical ordering
• Graph treewidth and geometric thickness parameters
• On obstacle numbers
• Obstacle Numbers of Planar Graphs
• Grid-Obstacle Representations with Connections to Staircase Guarding
• Turán Numbers of Bipartite Graphs and Related Ramsey-Type Questions
• Graphs with Obstacle Number Greater than One

This page was built for publication: Geodesic obstacle representation of graphs