131 search results - page 2 / 27 » Orthogonal thickness of graphs |
CPC
2010
13 years 5 months ago
2010
We investigate the end spaces of infinite dual graphs. We show that there exists a natural homeomorphism between the end spaces of a graph and its dual, and that this homeomorphis...
COMPGEOM
2004
ACM
13 years 10 months 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
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...
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...
DM
2000
13 years 5 months ago
2000
We determine the order of growth of the worst-case number of perfect subgraphs needed to cover an n-vertex graph.