Rectangle-visibility Layouts of Unions and Products of Trees | Zendy

Alice M. Dean | Zendy; Joan P. Hutchinson | Zendy

AI Assistant Blog Pricing

Home ZAIA Blog

Open Access

Rectangle-visibility Layouts of Unions and Products of Trees

Author(s) -

Alice M. Dean,

Joan P. Hutchinson

Publication year - 1998

Publication title -

journal of graph algorithms and applications

Language(s) - English

Resource type - Journals

SCImago Journal Rank - 0.387

H-Index - 38

ISSN - 1526-1719

DOI - 10.7155/jgaa.00011

Subject(s) - visibility , rectangle , computer science , tree (set theory) , combinatorics , mathematics , geometry , physics , optics

The paper considers representations of unions and products of trees as rectangle-visibility graphs (abbreviated RVGs), i.e., graphs whose vertices are rectangles in the plane, with adjacency determined by horizontal and vertical visibility. Our main results are that the union of any tree (or forest) with a depth-1 tree is an RVG, and that the union of two depth-2 trees and the union of a depth-3 tree with a matching are subgraphs of RVGs. We also show that the cartesian product of two forests is an RVG.

The content you want is available to Zendy users.

Already have an account? Click here to sign in.

Having issues? You can contact us here

Accelerating Research