15 search results - page 3 / 3 » arscom 2006 |
ARSCOM
2006
13 years 5 months ago
2006
A graph G is clique-perfect if the cardinality of a maximum cliqueindependent set of H is equal to the cardinality of a minimum cliquetransversal of H, for every induced subgraph ...
ARSCOM
2006
13 years 5 months ago
2006
ABSTRACT. The Levi graph of a balanced incomplete block design is the bipartite graph whose vertices are the points and blocks of the design, with each block adjacent to those poin...
ARSCOM
2006
13 years 5 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 ...
ARSCOM
2006
13 years 5 months ago
2006
The Grundy number of an impartial game G is the size of the unique Nim heap equal to G. We introduce a new variant of Nim, Restricted Nim, which restricts the number of stones a p...
ARSCOM
2006
13 years 5 months ago
2006
The posets of dimension 2 are those posets whose minimal realizations have two elements, that is, which may be obtained as the intersection of two of their linear extensions. Gall...