1632 search results - page 1 / 327 » On special numberings of hypergraphs |
DM
2000
15 years 7 days ago
2000
Generalizing a result of Bodendiek and Burosch on graphs it is proved that every vertex-simple
83
Voted
IPL
2006
15 years 12 days ago
2006
We present a matrix multiplication based algorithm for counting the number of (induced) occurrences of a fixed r-uniform hypergraph in a larger hypergraph. In many cases, the runn...
116
Voted
ARSCOM
2004
15 years 8 days ago
2004
The concept of circular chromatic number of graphs was introduced by Vince(1988). In this paper we define circular chromatic number of uniform hypergraphs and study their basic pr...
96
Voted
COMBINATORICS
2000
15 years 7 days ago
2000
A mixed hypergraph is a triple H = (V, C, D) where V is the vertex set and C and D are families of subsets of V , the C-edges and D-edges, respectively. A k-colouring of H is a ma...
114
Voted
ARSCOM
2006
15 years 14 days ago
2006
In this paper we define the concept of clique number of uniform hypergraph and study its relationship with circular chromatic number and clique number. For every positive integer ...