1729 search results - page 275 / 346 » Bound Graph Polysemy |
149
Voted
DCG
2007
15 years 5 months ago
2007
Steinitz’s Theorem states that a graph is the 1-skeleton of a convex polyhedron if and only if it is 3-connected and planar. The polyhedron is called a geometric realization of ...
178
Voted
ENDM
2007
15 years 5 months ago
2007
In this paper we investigate how certain results related to the HananiTutte theorem can be extended from the plane to surfaces. We give a simple topological proof that the weak Ha...
129
Voted
SIAMDM
2008
15 years 4 months ago
2008
For a real c 1 and an integer n, let f(n, c) denote the maximum integer f such that every graph on n vertices contains an induced subgraph on at least f vertices in which the max...
139
click to vote
DM
2002
15 years 4 months ago
2002
A generalized p-cycle is a digraph whose set of vertices can be partitioned into p parts that are cyclically ordered in such a way that the vertices in one part are adjacent only ...
158
click to vote
IJCM
2002
15 years 4 months ago
2002
A minimum spanning tree (MST) with a small diameter is required in numerous practical situations. It is needed, for example, in distributed mutual exclusion algorithms in order to...