Author： Krivelevich M.
Publisher： Academic Press
ISSN： 0196-6774
Source： Journal of Algorithms, Vol.25, Iss.1, 1997-10, pp. : 118-143
Disclaimer: Any content in publications that violate the sovereignty, the constitution or regulations of the PRC is not accepted or approved by CNPIEC.
Abstract
Related content
Access to resources
Recommend
Non-Jumping Numbers for 4-Uniform Hypergraphs
By Peng Yuejian
Graphs and Combinatorics, Vol. 23, Iss. 1, 2007-02 ,pp. :
Edge‐transitive homogeneous factorizations of complete uniform hypergraphs
JOURNAL OF GRAPH THEORY, Vol. 87, Iss. 3, 2018-03 ,pp. :
A note on random greedy coloring of uniform hypergraphs
RANDOM STRUCTURES AND ALGORITHMS, Vol. 47, Iss. 3, 2015-10 ,pp. :
Reoptimization of set covering problems
Cybernetics and Systems Analysis, Vol. 46, Iss. 6, 2010-11 ,pp. :