16 search results - page 2 / 4 » On Graph Thickness, Geometric Thickness, and Separator Theor... |
COMPGEOM
2004
ACM
14 years 23 days ago
2004
ACM
We prove that the geometric thickness of graphs whose maximum degree is no more than four is two. In our proofs, we present a space and time efficient embedding technique for gra...
GD
2005
Springer
14 years 26 days 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...
JGAA
2008
13 years 7 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...
EJC
2010
13 years 7 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...
GD
2004
Springer
14 years 21 days ago
2004
Springer
Consider the following question: does every complete geometric graph K2n have a partition of its edge set into n plane spanning trees? We approach this problem from three directio...