1632 search results - page 1 / 327 » On special numberings of hypergraphs |
DM
2000
13 years 10 months ago
2000
Generalizing a result of Bodendiek and Burosch on graphs it is proved that every vertex-simple
IPL
2006
13 years 11 months 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...
ARSCOM
2004
13 years 10 months 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...
COMBINATORICS
2000
13 years 10 months 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...
ARSCOM
2006
13 years 11 months 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 ...