2283 search results - page 76 / 457 » Bounds of Graph Characteristics |
RC
2007
13 years 7 months ago
2007
In many real-life situations, we only have partial information about probabilities. This information is usually described by bounds on moments, on probabilities of certain events,...
LATIN
2010
Springer
14 years 2 months ago
2010
Springer
In this paper, we consider the problem of representing graphs by polygons whose sides touch. We show that at least six sides per polygon are necessary by constructing a class of pl...
COCOON
2005
Springer
14 years 1 months ago
2005
Springer
For a bounded integer , we wish to color all edges of a graph G so that any two edges within distance have different colors. Such a coloring is called a distance-edge-coloring or ...
FSTTCS
2000
Springer
13 years 11 months ago
2000
Springer
We present a new scheme for storing a planar graph in external memory so that any online path can be traversed in an I-O efficient way. Our storage scheme significantly improves th...
COMBINATORICS
2006
13 years 8 months ago
2006
A set of vertices S is a determining set for a graph G if every automorphism of G is uniquely determined by its action on S. The determining number of a graph is the size of a sma...