Sciweavers

4 search results - page 1 / 1
» The thickness and chromatic number of r-inflated graphs
Sort
View
GD
2005
Springer
13 years 10 months ago
Bar k-Visibility Graphs: Bounds on the Number of Edges, Chromatic Number, and Thickness
Let S be a set of horizontal line segments, or bars, in the plane. We say that G is a bar visibility graph, and S its bar visibility representation, if there exists a one-to-one co...
Alice M. Dean, William Evans, Ellen Gethner, Joshu...
DM
2010
109views more  DM 2010»
13 years 5 months ago
The thickness and chromatic number of r-inflated graphs
Michael O. Albertson, Debra L. Boutin, Ellen Gethn...
JGAA
2008
100views more  JGAA 2008»
13 years 4 months ago
Parameters of Bar k-Visibility Graphs
Bar k-visibility graphs are graphs admitting a representation in which the vertices correspond to horizontal line segments, called bars, and the edges correspond to vertical lines...
Stefan Felsner, Mareike Massow
JGAA
2007
104views more  JGAA 2007»
13 years 4 months ago
Bar k-Visibility Graphs
Let S be a set of horizontal line segments, or bars, in the plane. We say that G is a bar visibility graph, and S its bar visibility representation, if there exists a one-to-one c...
Alice M. Dean, William Evans, Ellen Gethner, Joshu...