Unit rectangle visibility graphs

zbMath1179.05076arXiv0710.2279MaRDI QIDQ1010802

J. Martínez

Publication date: 7 April 2009

Published in: The Electronic Journal of Combinatorics (Search for Journal in Brave)

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

zbMATH Keywords

edge bound resultsrectangle visibility graphsunit rectangle visibility graphURVGVLSI chip design

Mathematics Subject Classification ID

Graph theory (including graph drawing) in computer science (68R10) Hardware implementations of nonnumerical algorithms (VLSI algorithms, etc.) (68W35) Graph algorithms (graph-theoretic aspects) (05C85) Applications of graph theory to circuits and networks (94C15) Graph representations (geometric and intersection representations, etc.) (05C62)

Related Items (6)

Visibility representations of boxes in 2.5 dimensions ⋮ Unit hypercube visibility numbers of trees ⋮ Combinatorial properties and recognition of unit square visibility graphs ⋮ Area, perimeter, height, and width of rectangle visibility graphs ⋮ Colored anchored visibility representations in 2D and 3D space ⋮ Unnamed Item

This page was built for publication: Unit rectangle visibility graphs