Characterization of [1, k]-Bar Visibility Trees

A unit bar-visibility graph is a graph whose vertices can be represented in the plane by disjoint horizontal unit-length bars such that two vertices are adjacent if and only if there is a unobstructed, non-degenerate, vertical band of visibility between the corresponding bars. We generalize unit bar-visibility graphs to [1, k]bar-visibility graphs by allowing the lengths of the bars to be between 1/k and

• Type: Journal
• Year: 2006
• Where: COMBINATORICS
• Authors: Guantao Chen, Joan P. Hutchinson, Ken Keating, Jian Shen
• Keywords: Bar-visibility Graphs, COMBINATORICS 2006, Unit Bar-visibility, Unit Bar-visibility Graph