Area, perimeter, height, and width of rectangle visibility graphs
From MaRDI portal
Publication:6084671
DOI10.1007/s10878-023-01084-9arXiv2208.09961MaRDI QIDQ6084671
John S. IV. Caughman, Joshua D. Laison, Colin L. Starr, Charles L. Dunn, Nancy Ann Neudauer
Publication date: 6 November 2023
Published in: Journal of Combinatorial Optimization (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/2208.09961
Graph theory (including graph drawing) in computer science (68R10) Computer graphics; computational geometry (digital and algorithmic aspects) (68U05) Graph representations (geometric and intersection representations, etc.) (05C62)
Cites Work
- Area requirement of visibility representations of trees
- Ortho-polygon visibility representations of embedded graphs
- Unit rectangle visibility graphs
- Representing a planar graph by vertical lines joining different levels
- A unified approach to visibility representations of planar graphs
- Rectangle-visibility representations of bipartite graphs
- A general notion of visibility graphs
- On representations of some thickness-two graphs
- An application of graph coloring to printed circuit testing
- Rectangle-visibility Layouts of Unions and Products of Trees
- Coloring Ordinary Maps, Maps of Empires, and Maps of the Moon
- A Visibility Representation for Graphs in Three Dimensions
- RECTANGLE AND BOX VISIBILITY GRAPHS IN 3D
- 3D Visibility Representations of 1-planar Graphs
- Ortho-polygon visibility representations of 3-connected 1-plane graphs
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
This page was built for publication: Area, perimeter, height, and width of rectangle visibility graphs