DECOMPOSITION OF COMPLETE MULTIGRAPHS INTO STARSTARSI M.1979; DISCRETE MATH.; NLD; DA. 1979; VOL. 26; NO 3; PP. 273-278; BIBL. 4 REF.Article

ON THE DECOMPOSITION OF A GRAPH INTO STARSTARSI M.1981; DISCRETE MATH.; ISSN 0012-365X; NLD; DA. 1981; VOL. 36; NO 3; PP. 299-304; BIBL. 3 REF.Article

Nowhere zero flow and circuit covering in regular matroidsTARSI, M.Journal of combinatorial theory. Series B. 1985, Vol 39, Num 3, pp 346-352, issn 0095-8956Article

Optimal search on some game treesTARSI, M.Journal of the Association for Computing Machinery. 1983, Vol 30, Num 3, pp 389-396, issn 0004-5411Article

Cycle covering of binary matroidsJAMSHY, U; TARSI, M.Journal of combinatorial theory. Series B. 1989, Vol 46, Num 2, pp 154-161, issn 0095-8956Article

Covering multigraphs by simple circuitsALON, N; TARSI, M.SIAM journal on algebraic and discrete methods. 1985, Vol 6, Num 3, pp 345-350, issn 0196-5212Article

Short cycle covers and the cycle double cover conjectureJAMSHY, U; TARSI, M.Journal of combinatorial theory. Series B. 1992, Vol 56, Num 2, pp 197-204, issn 0095-8956Article

Graph decomposition is NP-complete : A complete proof of holyer's conjectureDOR, D; TARSI, M.SIAM journal on computing (Print). 1997, Vol 26, Num 4, pp 1166-1187, issn 0097-5397Article

Deciding hypergraph 2-colourability by H-resolutionLINIAL, N; TARSI, M.Theoretical computer science. 1985, Vol 38, Num 2-3, pp 343-347, issn 0304-3975Article

Matroidal bijections between graphsLINIAL, N; MESHULAM, R; TARSI, M et al.Journal of combinatorial theory. Series B. 1988, Vol 45, Num 1, pp 31-44, issn 0095-8956Article

Group connectivity of graphs. A nonhomogeneous analogue of nowhere-zero flow propertiesJAEGER, F; LINIAL, N; PAYAN, C et al.Journal of combinatorial theory. Series B. 1992, Vol 56, Num 2, pp 165-182, issn 0095-8956Article

The utility of the ¹³C-galactose breath test as a measure of liver functionSAADEH, S; BEHRENS, P. W; TARSI, M. A et al.Alimentary pharmacology & therapeutics. 2003, Vol 18, Num 10, pp 995-1002, issn 0269-2813, 8 p.Article