263 search results - page 20 / 53 » ejc 2007 |
104
click to vote
EJC
2010
15 years 4 months ago
2010
Say a digraph is k-free if it has no directed cycles of length at most k, for k Z+ . Thomass
101
click to vote
EJC
2010
15 years 4 months ago
2010
A graph is k-linked (k-edge-linked), k 1, if for each k pairs of vertices x1, y1,
125
click to vote
EJC
2006
15 years 4 months ago
2006
An n-lift of a graph K, is a graph with vertex set V (K)
113
click to vote
EJC
2000
15 years 3 months ago
2000
Lower bounds on the size of t-fold blocking sets with respect to hyperplanes or t-intersection sets in AG(n, q) are obtained, some of which are sharp.
152
click to vote
EJC
2002
15 years 3 months ago
2002
In this paper, we prove the existence of acute triangulations for general polyhedral surfaces. We also show how to obtain nonobtuse subtriangulations of triangulated polyhedral sur...