Determination of silicate in seawater by inductively coupled plasma atomic emission spectrometryABE, K; WATANABE, Y.Nippon Kaiyo Gakkai-Shi. 1992, Vol 48, Num 3, pp 283-292, issn 0029-8131Article

Efficient parallel algorithms for testing k-connectivity and finding disjoint s-t paths in graphsKHULLER, S; SCHIEBER, B.SIAM journal on computing (Print). 1991, Vol 20, Num 2, pp 352-375, issn 0097-5397Article

Some linear Syzygy conjecturesEISENBUD, D; KOH, J.Advances in mathematics (New York, NY. 1965). 1991, Vol 90, Num 1, pp 47-76, issn 0001-8708Article

Polyominoes and animals : some recent resultsDELEST, M.Journal of mathematical chemistry. 1991, Vol 8, Num 1-3, pp 3-18, issn 0259-9791Article

Map coloring and the vector cross productKAUFFMAN, L. H.Journal of combinatorial theory. Series B. 1990, Vol 48, Num 2, pp 145-154, issn 0095-8956Article

Using triangles to partition a diskKNOBLAUCH, T.Discrete mathematics. 1990, Vol 84, Num 2, pp 209-211, issn 0012-365XArticle

Concerning two conjectures on the set of fixed points of a complete rotation of a Cayley digraphLICHIARDOPOL, Nicolas.Discrete mathematics. 2004, Vol 280, Num 1-3, pp 119-131, issn 0012-365X, 13 p.Article

Problèmes de 3-connexité dans les systèmes isotropes = Problems of 3-connectivity in isotropic systemsAllys, Loïc; Bouchet, André.1992, 115 p.Thesis

A short proof of a strange combinatorial identity conjectured by GosperEKHAD, S. B.Discrete mathematics. 1991, Vol 90, Num 3, pp 319-320, issn 0012-365XArticle

A unified treatment of a class of combinatorial sumsFANGJUN HSU; HSU, L. C.Discrete mathematics. 1991, Vol 90, Num 2, pp 191-197, issn 0012-365XArticle

Florentine rows or left-right shifted permutation matrices with cross-correlation values ≤1TAYLOR, H.Discrete mathematics. 1991, Vol 93, Num 2-3, pp 247-260, issn 0012-365XArticle

Splitting fields of association schemesMUNEMASA, A.Journal of combinatorial theory. Series A. 1991, Vol 57, Num 1, pp 157-161, issn 0097-3165Article

On log concave sequencesBECK, I; KROGDAHL, S.Discrete mathematics. 1991, Vol 94, Num 2, pp 141-145, issn 0012-365XArticle

Lifting map automorphisms and MacBeath's theoremSUROWSKI, D. B.Journal of combinatorial theory. Series B. 1990, Vol 50, Num 2, pp 135-149, issn 0095-8956Article

The combinatorics of identities involving three kinds of counting numbersLUN LV; PANG, Sabrina X. M.International journal of modelling, identification and control (Print). 2012, Vol 16, Num 3, pp 291-296, issn 1746-6172, 6 p.Article

A short proof of a theorem on degree sets of graphsTRIPATHI, Amitabha; VIJAY, Sujith.Discrete applied mathematics. 2007, Vol 155, Num 5, pp 670-671, issn 0166-218X, 2 p.Article

Consequences of an algorithm for bridged graphsVAN BANG LE; SPINRAD, Jerry.Discrete mathematics. 2004, Vol 280, Num 1-3, pp 271-274, issn 0012-365X, 4 p.Article

A note on the construction of row-and-column designs with two replicatesBAILEY, R. A; PATTERSON, H. D.Journal of the Royal Statistical Society. Series B. Methodological. 1991, Vol 53, Num 3, pp 645-648, issn 0035-9246Article

An extremal problem on sparse 0-1 matricesBIENSTOCK, D; GYÖR, E.SIAM journal on discrete mathematics (Print). 1991, Vol 4, Num 1, pp 17-27, issn 0895-4801Article

Isoperimetric inequalities and fractional set systemsBOLLOBAS, B; LEADER, I.Journal of combinatorial theory. Series A. 1991, Vol 56, Num 1, pp 63-74, issn 0097-3165Article

Projective equivalence of matroids with coefficientsWENZEL, W.Journal of combinatorial theory. Series A. 1991, Vol 57, Num 1, pp 15-45, issn 0097-3165Article

Two-colouring all two-element maximal antichainsDUFFUS, D; SANDS, B; SAUER, N et al.Journal of combinatorial theory. Series A. 1991, Vol 57, Num 1, pp 109-116, issn 0097-3165Article

Finding compact coordinate representations for polygons and polyhedraMILENKOVIC, V. J; NACKMAN, L. R.IBM journal of research and development. 1990, Vol 34, Num 5, pp 753-769, issn 0018-8646Article

Hecke-Rogers, Andrews identities; combinatorial proofsJOICHI, J. T.Discrete mathematics. 1990, Vol 84, Num 3, pp 255-259, issn 0012-365XArticle

Sum coloring and interval graphs: a tight upper bound for the minimum number of colorsNICOLOSO, S.Discrete mathematics. 2004, Vol 280, Num 1-3, pp 251-257, issn 0012-365X, 7 p.Article