2283 search results - page 34 / 457 » Bounds of Graph Characteristics |
ISAAC
2010
Springer
13 years 5 months ago
2010
Springer
It has been conjectured by Golumbic and Monma in 1984 that the intersection of tolerance and cocomparability graphs coincides with bounded tolerance graphs. Since cocomparability g...
BIRTHDAY
2009
Springer
14 years 2 months ago
2009
Springer
We introduce the weak gap property for directed graphs whose vertex set S is a metric space of size n. We prove that, if the doubling dimension of S is a constant, any directed gra...
SIROCCO
2000
13 years 9 months ago
2000
A graph with n vertices and maximum degree cannot be given weak sense of direction using less than colours. It is known that n colours are always sufficient, but it has been conje...
WG
1998
Springer
14 years 1 days ago
1998
Springer
Hierarchical decompositions of graphs are interesting for algorithmic purposes. There are several types of hierarchical decompositions. Tree decompositions are the best known ones....
COMPGEOM
1993
ACM
13 years 12 months ago
1993
ACM
We consider graphs such as the minimum spanning tree, minimum Steiner tree, minimum matching, and traveling salesman tour for n points in the d-dimensional unit cube. For each of ...