kw.\*:("HYPERGRAPH")
Results 1 to 25 of 1460
Selection :
On testing the pseudo-randomness' of a hypergraphHAVILAND, J; THOMASON, A.Discrete mathematics. 1992, Vol 103, Num 3, pp 321-327, issn 0012-365XArticle
Decomposable graphs and hypergraphsLAURITZEN, S. L; SPEED, T. P; VIJAYAN, K et al.Journal of the Australian Mathematical Society. Series A, Pure mathematics. 1984, Vol 36, Num 1, pp 12-29, issn 0334-3316Article
Great intersecting families of edges in hereditary hypergraphsMIKLOS, D.Discrete mathematics. 1984, Vol 48, Num 1, pp 95-99, issn 0012-365XArticle
The existence of regular self-complementary 3-uniform hypergraphsPOTOCNIK, Primoz; SAJNA, Mateja.Discrete mathematics. 2009, Vol 309, Num 4, pp 950-954, issn 0012-365X, 5 p.Article
A class of bichromatic hypergraphsFOURNIER, J.-C; VERGNAS, M. L.North-Holland mathematics studies. 1984, Vol 88, pp 21-27, issn 0304-0208Article
HEREDITARY DISCREPANCIES IN DIFFERENT NUMBERS OF COLORS IIDOERR, Benjamin; FOUZ, Mahmoud.SIAM journal on discrete mathematics (Print). 2011, Vol 24, Num 3, pp 1205-1213, issn 0895-4801, 9 p.Article
Recognising k-connected hypergraphs in cubic timeDREWES, F.Theoretical computer science. 1993, Vol 109, Num 1-2, pp 83-122, issn 0304-3975Conference Paper
A note on the Erdõs-Farber-Lovász conjectureJACKSON, Bill; SETHURAMAN, G; WHITEHEAD, Carol et al.Discrete mathematics. 2007, Vol 307, Num 7-8, pp 911-915, issn 0012-365X, 5 p.Conference Paper
Component structure in the evolution of random hypergraphsSCHMIDT-PRUZAN, J; SHAMIR, E.Combinatorica (Print). 1985, Vol 5, Num 1, pp 81-94, issn 0209-9683Article
Threshold hypergraphsREITERMAN, J; RÖDL, V; SINAJOVA, E et al.Discrete mathematics. 1985, Vol 54, Num 2, pp 193-200, issn 0012-365XArticle
Ramsey-type theoremsERDOS, P; HAJNAL, A.Discrete applied mathematics. 1989, Vol 25, Num 1-2, pp 37-52, issn 0166-218X, 16 p.Article
Normal hypergraphs and the weak perfect graph conjectureLOVASZ, L.North-Holland mathematics studies. 1984, Vol 88, pp 29-42, issn 0304-0208Article
Complete r-partite subgraphs of dense r-graphsNIKIFOROV, Vladimir.Discrete mathematics. 2009, Vol 309, Num 13, pp 4326-4331, issn 0012-365X, 6 p.Article
SUR LA CARDINALITE MAXIMUM DES COUPLAGES D'HYPERGRAPHES ALEATOIRES UNIFORMESFERNANDEZ DE LA VEGA W.1982; DISCRETE MATH.; ISSN 0012-365X; NLD; DA. 1982; VOL. 40; NO 2-3; PP. 315-318; BIBL. 2 REF.Article
PARTITIVE HYPERGRAPHSCHEIN M; HABIB M; MAURER MC et al.1981; DISCRETE MATH.; ISSN 0012-365X; NLD; DA. 1981; VOL. 37; NO 1; PP. 35-50; BIBL. 20 REF.Article
A characterization of hypercactiSONNTAG, Martin.Discrete mathematics. 2007, Vol 307, Num 21, pp 2615-2621, issn 0012-365X, 7 p.Article
On chromaticity of hypergraphsBOROWIECKI, Mieczyslaw; LAZUKA, Ewa.Discrete mathematics. 2007, Vol 307, Num 11-12, pp 1418-1429, issn 0012-365X, 12 p.Conference Paper
Fuzzy hypergraph and fuzzy partitionHYUNG LEE-KWANG; KEON-MYUNG LEE.IEEE transactions on systems, man, and cybernetics. 1995, Vol 25, Num 1, pp 196-201, issn 0018-9472Article
A THRESHOLD FOR PERFECT MATCHINGS IN RANDOM D-PURE HYPERGRAPHSSCHMIDT J; SHAMIR E.1983; DISCRETE MATHEMATICS; ISSN 0012-365X; NLD; DA. 1983; VOL. 45; NO 2-3; PP. 287-295; BIBL. 7 REF.Article
Loose Hamilton cycles in hypergraphsKEEVASH, Peter; KÜHN, Daniela; MYCROFT, Richard et al.Discrete mathematics. 2011, Vol 311, Num 7, pp 544-559, issn 0012-365X, 16 p.Article
A new algorithm for the hypergraph transversal problemKHACHIYAN, Leonid; BOROS, Endre; ELBASSIONI, Khaled et al.Lecture notes in computer science. 2005, pp 767-776, issn 0302-9743, isbn 3-540-28061-8, 10 p.Conference Paper
A note on the hypergraph functorHÖHLE, Ulrich.Fuzzy sets and systems. 2002, Vol 131, Num 3, pp 353-356, issn 0165-0114Article
A general framework for discovering and proving theorems of the Erdös-Ko-Rado typeSCHMERL, J. H.Journal of combinatorial theory. Series A. 1992, Vol 61, Num 2, pp 252-262, issn 0097-3165Article
Chromatic polynomials of hypergraphsDRGAS-BURCHARDT, Ewa; LAZUKA, Ewa.Applied mathematics letters. 2007, Vol 20, Num 12, pp 1250-1254, issn 0893-9659, 5 p.Article
Improved bounds and schemes for the declustering problemDOERR, Benjamin; HEBBINGHAUS, Nils; WERTH, Sören et al.Theoretical computer science. 2006, Vol 359, Num 1-3, pp 123-132, issn 0304-3975, 10 p.Article