44 search results - page 9 / 9 » endm 2007 |
ENDM
2007
13 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...
ENDM
2007
13 years 5 months ago
2007
We regard the problem of communication in the presence of faulty transmissions. In contrast to the classical works in this area, we assume some structure on the times when the faul...
ENDM
2008
13 years 5 months ago
2008
A graph G is clique-perfect if the cardinality of a maximum clique-independent set of H equals the cardinality of a minimum clique-transversal of H, for every induced subgraph H o...
ENDM
2007
13 years 5 months ago
2007
For a graph G and an integer t we let mcct(G) be the smallest m such that there exists a coloring of the vertices of G by t colors with no monochromatic connected subgraph having ...