603 search results - page 59 / 121 » Word or Phrase |
COMBINATORICS
2000
13 years 7 months ago
2000
In a previous paper it was established that there are at least 27 non-isomorphic strongly regular (40, 12, 2, 4) graphs. Using a different and more efficient method we have re-inv...
DM
2002
13 years 7 months ago
2002
In 1993, Brualdi and Massey conjectured that every graph can be incidence colored with + 2 colors, where is the maximum degree of a graph. Although this conjecture was solved in ...
DM
2002
13 years 7 months ago
2002
Let f1 and f2 be graph parameters. The Ramsey number r(f1 m; f2 n) is defined as the minimum integer N such that any graph G on N vertices, either f1(G) m or f2(G) n. A genera...
MOR
2000
13 years 7 months ago
2000
Given a network and a set of connection requests on it, we consider the maximum edge-disjoint paths and related generalizations and routing problems that arise in assigning paths f...
CSUR
1999
13 years 7 months ago
1999
: Information Visualization can make hypermedia systems more usable by presenting a site map to assist in navigation. In this paper we explain some of the difficulties in developin...