Sciweavers

3204 search results - page 22 / 641
» The Alcuin Number of a Graph
Sort
View
JCT
2011
93views more  JCT 2011»
12 years 10 months ago
A graph-theoretic approach to quasigroup cycle numbers
Abstract. Norton and Stein associated a number with each idempotent quasigroup or diagonalized Latin square of given finite order n, showing that it is congruent mod 2 to the tria...
Brent Kerby, Jonathan D. H. Smith
DM
2002
101views more  DM 2002»
13 years 7 months ago
On generalized Ramsey numbers
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...
Wai Chee Shiu, Peter Che Bor Lam, Yusheng Li
SIAMDM
2000
159views more  SIAMDM 2000»
13 years 7 months ago
Approximating Fractional Multicommodity Flow Independent of the Number of Commodities
Abstract. We describe fully polynomial time approximation schemes for various multicommodity flow problems in graphs with m edges and n vertices. We present the first approximation...
Lisa Fleischer
JGT
2010
127views more  JGT 2010»
13 years 6 months ago
On the minimum degree of minimal Ramsey graphs
We investigate the minimization problem of the minimum degree of minimal Ramsey graphs, initiated by Burr, Erd˝os, and Lov´asz. We determine the corresponding graph parameter fo...
Tibor Szabó, Philipp Zumstein, Stefanie Z&u...
PARA
2004
Springer
14 years 1 months ago
Counting the Number of Connected Components of a Set and Its Application to Robotics
This paper gives a numerical algorithm able to compute the number of path-connected components of a set S defined by nonlinear inequalities. This algorithm uses interval analysis ...
Nicolas Delanoue, Luc Jaulin, Bertrand Cottenceau