Visibility representations of toroidal and Klein-bottle graphs

DOI10.1007/978-3-031-22203-0_29arXiv2209.00576MaRDI QIDQ6172216

Therese C. Biedl

Publication date: 16 August 2023

Published in: Lecture Notes in Computer Science (Search for Journal in Brave)

Full work available at URL: https://arxiv.org/abs/2209.00576

Mathematics Subject Classification ID

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

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• How to draw a planar graph on a grid
• Representing a planar graph by vertical lines joining different levels
• A unified approach to visibility representations of planar graphs
• Rectilinear planar layouts and bipolar orientations of planar graphs
• The max clique problem in classes of string-graphs
• Computing an st-numbering
• Tesselation and visibility representations of maps on the torus
• A better heuristic for orthogonal graph drawings
• A note on rectilinear and polar visibility graphs
• Graph Theory
• Representations of Graphs on a Cylinder
• On the independence ratio of a graph
• The Vertex-Disjoint Menger Problem in Planar Graphs
• A Visibility Representation for Graphs in Three Dimensions
• Canonical Ordering for Graphs on the Cylinder with Applications to Periodic Straight-line Drawings on the Flat Cylinder and Torus
• Every planar graph is the intersection graph of segments in the plane
• Bar k-Visibility Graphs