48 search results - page 2 / 10 » Geometric Thickness of Complete Graphs |
GD
2005
Springer
13 years 10 months ago
2005
Springer
Consider a drawing of a graph G in the plane such that crossing edges are coloured differently. The minimum number of colours, taken over all drawings of G, is the classical graph...
GD
2005
Springer
13 years 10 months ago
2005
Springer
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...
EJC
2010
13 years 4 months ago
2010
Let be a finite building (or, more generally, a thick spherical and locally finite building). The chamber graph G(), whose edges are the pairs of adjacent chambers in , is known t...
JGAA
2008
13 years 4 months ago
2008
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...
JCDCG
2000
Springer
13 years 8 months ago
2000
Springer
