2283 search results - page 243 / 457 » Bounds of Graph Characteristics |
COMGEO
2002
ACM
13 years 8 months ago
2002
ACM
A fractal construction shows that, for any > 0, the -skeleton of a point set can have arbitrarily large dilation: (nc ), where c is a constant depending on and going to zero ...
SIAMDM
2010
13 years 3 months ago
2010
Every 3-graph in which no four vertices are independent and no four vertices span precisely three edges must have edge density 4/9(1 - o(1)). This bound is tight. The proof is a r...
CORR
2010
Springer
13 years 2 months ago
2010
Springer
Unique-sink orientations (USOs) are an abstract class of orientations of the ncube graph. We consider some classes of USOs that are of interest in connection with the linear compl...
SAC
2009
ACM
14 years 3 months ago
2009
ACM
Graph drawing and visualization represent structural information ams of abstract graphs and networks. An important subset of graphs is directed acyclic graphs (DAGs). E-Spring alg...
COCOON
2003
Springer
14 years 1 months ago
2003
Springer
The relationship between graph coloring and the immersion order is considered. Vertex connectivity, edge connectivity and related issues are explored. These lead to the conjecture...