Sciweavers

ENDM
2002
91views more  ENDM 2002»
13 years 10 months ago
On minimally 3-connected graphs on a surface
It is well-known that the maximal size of minimally 3-connected graphs of order 7n is 93 -n . In this paper, we shall prove that if G is a minimally 3-connected graph of order n, ...
Katsuhiro Ota
COMBINATORICS
2007
91views more  COMBINATORICS 2007»
13 years 11 months ago
Intersecting Families in the Alternating Group and Direct Product of Symmetric Groups
Let Sn denote the symmetric group on [n] = {1, . . . , n}. A family I ⊆ Sn is intersecting if any two elements of I have at least one common entry. It is known that the only int...
Cheng Yeaw Ku, Tony W. H. Wong
IEICET
2006
77views more  IEICET 2006»
13 years 11 months ago
Efficient Scheduling for SDMG CIOQ Switches
ng problem for the SDMG CIOQ switch is abstracted as a bipartite k-matching problem. Using fluid model techniques, we prove that any maximal size k-matching algorithm on an SDMG CI...
Mei Yang, Si-Qing Zheng