Efficient testing of hypergraphs: (Extended abstract)KOHAYAKAWA, Yoshiharu; NAGLE, Brendan; RÖDL, Vojtech et al.Lecture notes in computer science. 2002, pp 1017-1028, issn 0302-9743, isbn 3-540-43864-5, 12 p.Conference Paper

The friendship theoremHUNEKE, Craig.The American mathematical monthly. 2002, Vol 109, Num 2, pp 192-194, issn 0002-9890Article

Various inverses of a strong endomorphism of a graphWEIMIN LI.Discrete mathematics. 2005, Vol 300, Num 1-3, pp 245-255, issn 0012-365X, 11 p.Article

Strongly indexable graphsACHARYA, B. D; HEGDE, S. M.Discrete mathematics. 1991, Vol 93, Num 2-3, pp 123-129, issn 0012-365XArticle

Subgraphs of 4-Regular Planar GraphsDOWDEN, Chris; ADDARIO-BERRY, Louigi.Algorithmica. 2011, Vol 61, Num 3, pp 758-776, issn 0178-4617, 19 p.Article

A family of regular graphs of girth 5ABREU, M; FUNK, M; LABBATE, D et al.Discrete mathematics. 2008, Vol 308, Num 10, pp 1810-1815, issn 0012-365X, 6 p.Article

On the connectivity of (k, g)-cages of even girthYUQING LIN; BALBUENA, Camino; MARCOTE, Xavier et al.Discrete mathematics. 2008, Vol 308, Num 15, pp 3249-3256, issn 0012-365X, 8 p.Article

Discrete path integral approach to the selberg trace formula for regular graphsMNËV, P.Communications in mathematical physics. 2007, Vol 274, Num 1, pp 233-241, issn 0010-3616, 9 p.Article

The face pair of planar graphsYANG YUANSHENG; LIN XIAOHUI; QIAO JING et al.Discrete mathematics. 2006, Vol 306, Num 15, pp 1742-1757, issn 0012-365X, 16 p.Article

5-regular graphs are 3-colorable with positive probabilityDIAZ, J; GRAMMATIKOPOULOS, G; KAPORIS, A. C et al.Lecture notes in computer science. 2005, pp 215-225, issn 0302-9743, isbn 3-540-29118-0, 1Vol, 11 p.Conference Paper

On some super fault-tolerant Hamiltonian graphsCHEN, Y.-Chuang; TSAI, Chang-Hsiung; HSU, Lih-Hsing et al.Applied mathematics and computation. 2004, Vol 148, Num 3, pp 729-741, issn 0096-3003, 13 p.Article

Fisher's inequality for designs on regular graphsIONIN, Yury J; SHRIKHANDE, Mohan S.Journal of statistical planning and inference. 2002, Vol 100, Num 2, pp 185-190, issn 0378-3758Article

Orthogonal MatchingsSTONG, Richard.Discrete mathematics. 2002, Vol 256, Num 1-2, pp 513-518, issn 0012-365XArticle

Strongly regular graphs from differences of quadricsHAMILTON, Nicholas.Discrete mathematics. 2002, Vol 256, Num 1-2, pp 465-469, issn 0012-365XArticle

On 2-regular subgraphs in polyhedral graphsGÖRING, Frank.Discrete mathematics. 2002, Vol 251, Num 1-3, pp 97-102, issn 0012-365XConference Paper

Multimatroids. I. Coverings by independent setsBOUCHET, A.SIAM journal on discrete mathematics (Print). 1997, Vol 10, Num 4, pp 626-646, issn 0895-4801Article

Cogrowth of regular graphsNORTHSHIELD, S.Proceedings of the American Mathematical Society. 1992, Vol 116, Num 1, pp 203-205, issn 0002-9939Article

Hamilton cycles in regular 3-connected graphsYONGJIN ZHU; HAO LI.Discrete mathematics. 1992, Vol 110, Num 1-3, pp 229-249, issn 0012-365XArticle

Orientable quadrilateral embeddings of products of graphsPISANSKI, T.Discrete mathematics. 1992, Vol 109, Num 1-3, pp 203-205, issn 0012-365XArticle

Edge-isoperimetric inequalities in the gridBOLLOBAS, B; LEADER, I.Combinatorica (Print). 1991, Vol 11, Num 4, pp 299-314, issn 0209-9683Article

Outline symmetric latin squaresCHETWYND, A. G; HILTON, A. J. W.Discrete mathematics. 1991, Vol 97, Num 1-3, pp 101-117, issn 0012-365XArticle

Symmetric divisible designs with k-λ₁=1ARASU, K. T; JUNGNICKEL, D; POTT, A et al.Discrete mathematics. 1991, Vol 97, Num 1-3, pp 25-38, issn 0012-365XArticle

On the construction of optimally reliable graphsSMITH, D. H; DOTY, L. L.Networks (New York, NY). 1990, Vol 20, Num 6, pp 723-729, issn 0028-3045Article

All primitive strongly regular graphs except four are hyperenergeticPANIGRAHI, Pratima; MOHAPATRA, R. N.Applied mathematics letters. 2011, Vol 24, Num 12, pp 1995-1997, issn 0893-9659, 3 p.Article

Eigenvalues and edge-connectivity of regular graphsCIOABA, Sebastian M.Linear algebra and its applications. 2010, Vol 432, Num 1, pp 458-470, issn 0024-3795, 13 p.Article